/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/cohencu-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:01:55,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:01:55,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:01:55,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:01:55,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:01:55,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:01:55,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:01:55,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:01:55,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:01:55,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:01:55,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:01:55,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:01:55,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:01:55,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:01:55,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:01:55,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:01:55,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:01:55,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:01:55,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:01:55,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:01:55,116 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:01:55,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:01:55,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:01:55,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:01:55,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:01:55,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:01:55,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:01:55,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:01:55,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:01:55,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:01:55,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:01:55,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:01:55,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:01:55,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:01:55,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:01:55,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:01:55,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:01:55,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:01:55,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:01:55,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:01:55,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:01:55,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:01:55,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:01:55,156 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:01:55,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:01:55,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:01:55,157 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:01:55,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:01:55,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:01:55,158 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:01:55,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:01:55,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:01:55,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:01:55,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:01:55,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:01:55,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:01:55,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:01:55,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:01:55,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:01:55,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:01:55,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:01:55,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:01:55,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:01:55,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:01:55,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:01:55,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:01:55,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:01:55,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:01:55,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:01:55,161 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:01:55,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:01:55,162 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:01:55,162 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 23:01:55,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:01:55,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:01:55,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:01:55,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:01:55,415 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:01:55,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-04-27 23:01:55,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653daa1cb/c1185b3edf3a48e1bb2098b08faf8da2/FLAG2f3f8ae46 [2022-04-27 23:01:55,793 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:01:55,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-04-27 23:01:55,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653daa1cb/c1185b3edf3a48e1bb2098b08faf8da2/FLAG2f3f8ae46 [2022-04-27 23:01:56,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653daa1cb/c1185b3edf3a48e1bb2098b08faf8da2 [2022-04-27 23:01:56,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:01:56,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:01:56,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:01:56,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:01:56,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:01:56,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5a41f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56, skipping insertion in model container [2022-04-27 23:01:56,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:01:56,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:01:56,349 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/cohencu-ll_unwindbound1.c[588,601] [2022-04-27 23:01:56,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:01:56,399 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:01:56,407 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/cohencu-ll_unwindbound1.c[588,601] [2022-04-27 23:01:56,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:01:56,425 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:01:56,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56 WrapperNode [2022-04-27 23:01:56,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:01:56,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:01:56,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:01:56,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:01:56,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:01:56,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:01:56,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:01:56,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:01:56,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:01:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:01:56,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:01:56,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:01:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:01:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:01:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:01:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:01:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:01:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:01:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:01:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:01:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:01:56,559 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:01:56,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:01:56,730 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:01:56,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:01:56,735 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 23:01:56,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:01:56 BoogieIcfgContainer [2022-04-27 23:01:56,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:01:56,737 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:01:56,737 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:01:56,738 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:01:56,740 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:01:56" (1/1) ... [2022-04-27 23:01:56,741 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:01:56,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:01:56 BasicIcfg [2022-04-27 23:01:56,758 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:01:56,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:01:56,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:01:56,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:01:56,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:01:56" (1/4) ... [2022-04-27 23:01:56,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3affd767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:01:56, skipping insertion in model container [2022-04-27 23:01:56,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (2/4) ... [2022-04-27 23:01:56,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3affd767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:01:56, skipping insertion in model container [2022-04-27 23:01:56,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:01:56" (3/4) ... [2022-04-27 23:01:56,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3affd767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:01:56, skipping insertion in model container [2022-04-27 23:01:56,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:01:56" (4/4) ... [2022-04-27 23:01:56,763 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.cqvasr [2022-04-27 23:01:56,773 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:01:56,774 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:01:56,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:01:56,831 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@10ff0848, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42d12541 [2022-04-27 23:01:56,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:01:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 23:01:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 23:01:56,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:01:56,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:01:56,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:01:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:01:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-27 23:01:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:01:56,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178639869] [2022-04-27 23:01:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:56,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:01:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:01:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:57,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 23:01:57,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 23:01:57,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 23:01:57,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:01:57,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 23:01:57,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 23:01:57,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 23:01:57,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 23:01:57,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {34#true} is VALID [2022-04-27 23:01:57,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [90] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 23:01:57,046 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {35#false} is VALID [2022-04-27 23:01:57,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-27 23:01:57,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 23:01:57,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 23:01:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:01:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:01:57,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178639869] [2022-04-27 23:01:57,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178639869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:01:57,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:01:57,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:01:57,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713194006] [2022-04-27 23:01:57,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:01:57,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 23:01:57,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:01:57,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:57,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:01:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:01:57,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:01:57,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:01:57,095 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:57,304 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-27 23:01:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:01:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 23:01:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:01:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 23:01:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 23:01:57,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 23:01:57,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:57,409 INFO L225 Difference]: With dead ends: 57 [2022-04-27 23:01:57,410 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 23:01:57,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:01:57,414 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:01:57,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:01:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 23:01:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 23:01:57,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:01:57,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,436 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,436 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:57,440 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 23:01:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 23:01:57,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:57,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:57,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 23:01:57,442 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 23:01:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:57,444 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 23:01:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 23:01:57,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:57,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:57,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:01:57,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:01:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-27 23:01:57,449 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-27 23:01:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:01:57,449 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-27 23:01:57,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-27 23:01:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 23:01:57,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:01:57,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:01:57,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:01:57,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:01:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:01:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-27 23:01:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:01:57,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854712515] [2022-04-27 23:01:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:01:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:01:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:57,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:01:57,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {232#(= ~counter~0 0)} is VALID [2022-04-27 23:01:57,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {233#(= |main_#t~post5| 0)} is VALID [2022-04-27 23:01:57,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 1)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {228#false} is VALID [2022-04-27 23:01:57,514 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {228#false} is VALID [2022-04-27 23:01:57,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {228#false} is VALID [2022-04-27 23:01:57,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {228#false} is VALID [2022-04-27 23:01:57,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#false} is VALID [2022-04-27 23:01:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:01:57,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:01:57,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854712515] [2022-04-27 23:01:57,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854712515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:01:57,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:01:57,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 23:01:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335559306] [2022-04-27 23:01:57,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:01:57,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 23:01:57,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:01:57,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:57,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:01:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:01:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:01:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:01:57,527 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:57,746 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-27 23:01:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:01:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 23:01:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:01:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-27 23:01:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-27 23:01:57,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-27 23:01:57,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:57,810 INFO L225 Difference]: With dead ends: 40 [2022-04-27 23:01:57,810 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 23:01:57,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:01:57,814 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:01:57,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:01:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 23:01:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 23:01:57,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:01:57,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,823 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,824 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:57,829 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 23:01:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 23:01:57,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:57,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:57,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 23:01:57,836 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 23:01:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:57,838 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 23:01:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 23:01:57,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:57,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:57,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:01:57,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:01:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-27 23:01:57,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-27 23:01:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:01:57,844 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-27 23:01:57,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 23:01:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 23:01:57,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:01:57,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:01:57,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 23:01:57,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:01:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:01:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-27 23:01:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:01:57,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272191759] [2022-04-27 23:01:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:01:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:57,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:01:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:57,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {406#true} is VALID [2022-04-27 23:01:57,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-27 23:01:57,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-27 23:01:57,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:01:57,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {406#true} is VALID [2022-04-27 23:01:57,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-27 23:01:57,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-27 23:01:57,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-04-27 23:01:57,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 23:01:57,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 23:01:57,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 23:01:57,923 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:01:57,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:01:57,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {407#false} is VALID [2022-04-27 23:01:57,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#false} is VALID [2022-04-27 23:01:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 23:01:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:01:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272191759] [2022-04-27 23:01:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272191759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:01:57,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:01:57,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 23:01:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419295959] [2022-04-27 23:01:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:01:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 23:01:57,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:01:57,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:57,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:57,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 23:01:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:01:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 23:01:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:01:57,941 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:58,353 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-27 23:01:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:01:58,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 23:01:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:01:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 23:01:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 23:01:58,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 23:01:58,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:58,400 INFO L225 Difference]: With dead ends: 34 [2022-04-27 23:01:58,400 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 23:01:58,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:01:58,401 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:01:58,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:01:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 23:01:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 23:01:58,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:01:58,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:58,406 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:58,406 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:58,408 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 23:01:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 23:01:58,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:58,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:58,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 23:01:58,409 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 23:01:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:58,411 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 23:01:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 23:01:58,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:58,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:58,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:01:58,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:01:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:01:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 23:01:58,413 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-27 23:01:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:01:58,413 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 23:01:58,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 23:01:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 23:01:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 23:01:58,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:01:58,413 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:01:58,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 23:01:58,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:01:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:01:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-27 23:01:58,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:01:58,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097642063] [2022-04-27 23:01:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:01:58,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:01:58,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608381488] [2022-04-27 23:01:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:58,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:01:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:01:58,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:01:58,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:01:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:58,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:01:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:58,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:01:58,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-27 23:01:58,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {593#true} is VALID [2022-04-27 23:01:58,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-27 23:01:58,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-27 23:01:58,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-27 23:01:58,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 23:01:58,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 23:01:58,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 23:01:58,589 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {593#true} is VALID [2022-04-27 23:01:58,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {593#true} is VALID [2022-04-27 23:01:58,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} [100] L15-->L15-2: Formula: (not (= 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[] {593#true} is VALID [2022-04-27 23:01:58,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-27 23:01:58,590 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 23:01:58,591 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:01:58,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:01:58,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-27 23:01:58,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-27 23:01:58,592 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-27 23:01:58,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:01:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:01:58,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097642063] [2022-04-27 23:01:58,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:01:58,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608381488] [2022-04-27 23:01:58,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608381488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:01:58,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:01:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:01:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245496206] [2022-04-27 23:01:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:01:58,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 23:01:58,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:01:58,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:01:58,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:58,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:01:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:01:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:01:58,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:01:58,606 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:01:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:58,809 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-27 23:01:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:01:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 23:01:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:01:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:01:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:01:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:01:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:01:58,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 23:01:58,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:58,868 INFO L225 Difference]: With dead ends: 50 [2022-04-27 23:01:58,869 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 23:01:58,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:01:58,876 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:01:58,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:01:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 23:01:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-27 23:01:58,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:01:58,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 23:01:58,894 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 23:01:58,894 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 23:01:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:58,898 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 23:01:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 23:01:58,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:58,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:58,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 23:01:58,899 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 23:01:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:58,903 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 23:01:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 23:01:58,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:58,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:58,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:01:58,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:01:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 23:01:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-27 23:01:58,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-27 23:01:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:01:58,907 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-27 23:01:58,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 23:01:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-27 23:01:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 23:01:58,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:01:58,907 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:01:58,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 23:01:59,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:01:59,124 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:01:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:01:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-27 23:01:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:01:59,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336509481] [2022-04-27 23:01:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:01:59,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:01:59,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454046529] [2022-04-27 23:01:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:59,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:01:59,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:01:59,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:01:59,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:01:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:59,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:01:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:59,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:01:59,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-27 23:01:59,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {887#true} is VALID [2022-04-27 23:01:59,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-27 23:01:59,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-27 23:01:59,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-27 23:01:59,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 23:01:59,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 23:01:59,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 23:01:59,262 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {887#true} is VALID [2022-04-27 23:01:59,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {887#true} is VALID [2022-04-27 23:01:59,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} [100] L15-->L15-2: Formula: (not (= 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[] {887#true} is VALID [2022-04-27 23:01:59,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-27 23:01:59,263 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 23:01:59,263 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {887#true} is VALID [2022-04-27 23:01:59,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {887#true} is VALID [2022-04-27 23:01:59,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} [100] L15-->L15-2: Formula: (not (= 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[] {887#true} is VALID [2022-04-27 23:01:59,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#true} is VALID [2022-04-27 23:01:59,264 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 23:01:59,264 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:01:59,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:01:59,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {888#false} is VALID [2022-04-27 23:01:59,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {888#false} is VALID [2022-04-27 23:01:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:01:59,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:01:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:01:59,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336509481] [2022-04-27 23:01:59,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:01:59,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454046529] [2022-04-27 23:01:59,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454046529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:01:59,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:01:59,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:01:59,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982236998] [2022-04-27 23:01:59,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:01:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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 22 [2022-04-27 23:01:59,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:01:59,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-27 23:01:59,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:59,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:01:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:01:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:01:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:01:59,279 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-27 23:01:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:59,560 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-27 23:01:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:01:59,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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 22 [2022-04-27 23:01:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:01:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-27 23:01:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:01:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-27 23:01:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:01:59,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 23:01:59,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:01:59,620 INFO L225 Difference]: With dead ends: 54 [2022-04-27 23:01:59,620 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 23:01:59,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:01:59,620 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:01:59,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:01:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 23:01:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 23:01:59,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:01:59,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:01:59,629 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:01:59,630 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:01:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:59,632 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 23:01:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 23:01:59,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:59,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:59,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 23:01:59,633 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 23:01:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:01:59,634 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 23:01:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 23:01:59,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:01:59,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:01:59,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:01:59,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:01:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 23:01:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-27 23:01:59,637 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-27 23:01:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:01:59,637 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-27 23:01:59,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 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-27 23:01:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-27 23:01:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 23:01:59,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:01:59,638 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] [2022-04-27 23:01:59,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:01:59,851 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-27 23:01:59,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:01:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:01:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-27 23:01:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:01:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155731474] [2022-04-27 23:01:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:01:59,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:01:59,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541235652] [2022-04-27 23:01:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:01:59,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:01:59,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:01:59,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:01:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:01:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:59,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:01:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:01:59,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:02:00,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-27 23:02:00,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1225#true} is VALID [2022-04-27 23:02:00,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-27 23:02:00,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-27 23:02:00,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-27 23:02:00,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 23:02:00,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 23:02:00,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 1) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 23:02:00,017 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1225#true} is VALID [2022-04-27 23:02:00,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#true} is VALID [2022-04-27 23:02:00,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} [100] L15-->L15-2: Formula: (not (= 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[] {1225#true} is VALID [2022-04-27 23:02:00,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-27 23:02:00,018 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 23:02:00,018 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1225#true} is VALID [2022-04-27 23:02:00,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#true} is VALID [2022-04-27 23:02:00,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} [100] L15-->L15-2: Formula: (not (= 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[] {1225#true} is VALID [2022-04-27 23:02:00,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-27 23:02:00,019 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 23:02:00,019 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1225#true} is VALID [2022-04-27 23:02:00,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1225#true} is VALID [2022-04-27 23:02:00,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} [100] L15-->L15-2: Formula: (not (= 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[] {1225#true} is VALID [2022-04-27 23:02:00,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#true} is VALID [2022-04-27 23:02:00,022 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 23:02:00,022 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:02:00,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:02:00,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1226#false} is VALID [2022-04-27 23:02:00,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1226#false} is VALID [2022-04-27 23:02:00,028 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-27 23:02:00,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:02:00,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:02:00,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155731474] [2022-04-27 23:02:00,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:02:00,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541235652] [2022-04-27 23:02:00,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541235652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:02:00,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:02:00,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:02:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638043305] [2022-04-27 23:02:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:02:00,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 27 [2022-04-27 23:02:00,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:02:00,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:02:00,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:02:00,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:02:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:02:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:02:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:02:00,045 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:02:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:02:00,310 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-27 23:02:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:02:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 27 [2022-04-27 23:02:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:02:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:02:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:02:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:02:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 23:02:00,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 23:02:00,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:02:00,366 INFO L225 Difference]: With dead ends: 62 [2022-04-27 23:02:00,366 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 23:02:00,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:02:00,367 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:02:00,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:02:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 23:02:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 23:02:00,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:02:00,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:02:00,374 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:02:00,374 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:02:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:02:00,376 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 23:02:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 23:02:00,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:02:00,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:02:00,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 23:02:00,377 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 23:02:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:02:00,378 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 23:02:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 23:02:00,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:02:00,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:02:00,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:02:00,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:02:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 23:02:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-27 23:02:00,380 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-27 23:02:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:02:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-27 23:02:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:02:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 23:02:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 23:02:00,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:02:00,381 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:02:00,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 23:02:00,591 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-27 23:02:00,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:02:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:02:00,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-27 23:02:00,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:02:00,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877828955] [2022-04-27 23:02:00,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:02:00,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:02:00,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:02:00,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267834199] [2022-04-27 23:02:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:02:00,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:02:00,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:02:00,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:02:00,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:02:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 23:02:00,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 23:02:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 23:02:00,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 23:02:00,671 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 23:02:00,671 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 23:02:00,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 23:02:00,889 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-27 23:02:00,892 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:02:00,894 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 23:02:00,920 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 23:02:00,922 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 23:02:00,922 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-27 23:02:00,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:02:00 BasicIcfg [2022-04-27 23:02:00,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 23:02:00,923 INFO L158 Benchmark]: Toolchain (without parser) took 4707.57ms. Allocated memory was 189.8MB in the beginning and 293.6MB in the end (delta: 103.8MB). Free memory was 132.1MB in the beginning and 181.4MB in the end (delta: -49.3MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2022-04-27 23:02:00,923 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 23:02:00,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.62ms. Allocated memory was 189.8MB in the beginning and 293.6MB in the end (delta: 103.8MB). Free memory was 132.0MB in the beginning and 264.5MB in the end (delta: -132.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-27 23:02:00,924 INFO L158 Benchmark]: Boogie Preprocessor took 29.81ms. Allocated memory is still 293.6MB. Free memory was 264.5MB in the beginning and 262.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 23:02:00,924 INFO L158 Benchmark]: RCFGBuilder took 280.33ms. Allocated memory is still 293.6MB. Free memory was 262.9MB in the beginning and 250.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 23:02:00,924 INFO L158 Benchmark]: IcfgTransformer took 20.53ms. Allocated memory is still 293.6MB. Free memory was 250.3MB in the beginning and 248.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:02:00,924 INFO L158 Benchmark]: TraceAbstraction took 4163.81ms. Allocated memory is still 293.6MB. Free memory was 248.2MB in the beginning and 181.4MB in the end (delta: 66.8MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2022-04-27 23:02:00,925 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.09ms. Allocated memory is still 189.8MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.62ms. Allocated memory was 189.8MB in the beginning and 293.6MB in the end (delta: 103.8MB). Free memory was 132.0MB in the beginning and 264.5MB in the end (delta: -132.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.81ms. Allocated memory is still 293.6MB. Free memory was 264.5MB in the beginning and 262.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 280.33ms. Allocated memory is still 293.6MB. Free memory was 262.9MB in the beginning and 250.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 20.53ms. Allocated memory is still 293.6MB. Free memory was 250.3MB in the beginning and 248.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4163.81ms. Allocated memory is still 293.6MB. Free memory was 248.2MB in the beginning and 181.4MB in the end (delta: 66.8MB). Peak memory consumption was 67.8MB. 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] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=1, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=1, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<1 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) 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(x == n * n * n) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 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] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 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] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=1, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=1, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=1, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND FALSE !(counter++<1) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=1, counter=2, n=1, x=1, y=7, z=12] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=2] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 578 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 330 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 248 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, InterpolantAutomatonStates: 32, 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, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 3 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 23 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-27 23:02:00,940 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...