/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/ps4-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:22:01,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:22:01,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:22:01,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:22:01,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:22:01,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:22:01,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:22:01,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:22:01,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:22:01,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:22:01,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:22:01,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:22:01,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:22:01,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:22:01,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:22:01,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:22:01,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:22:01,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:22:01,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:22:01,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:22:01,842 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:22:01,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:22:01,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:22:01,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:22:01,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:22:01,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:22:01,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:22:01,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:22:01,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:22:01,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:22:01,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:22:01,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:22:01,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:22:01,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:22:01,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:22:01,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:22:01,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:22:01,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:22:01,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:22:01,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:22:01,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:22:01,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:22:01,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:22:01,885 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:22:01,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:22:01,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:22:01,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:22:01,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:22:01,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:22:01,887 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:22:01,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:22:01,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:22:01,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:22:01,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:22:01,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:22:01,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:22:01,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:22:01,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:22:01,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:22:01,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:22:01,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:22:01,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:22:01,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:22:01,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:22:01,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:22:01,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:22:01,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:22:01,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:22:01,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:22:01,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:22:01,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:22:01,893 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:22:01,893 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-08 02:22:02,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:22:02,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:22:02,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:22:02,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:22:02,130 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:22:02,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c [2022-04-08 02:22:02,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b7bf14f/0a3ed200d8f24bf0a62cc918d14dfeef/FLAGaf6a78e04 [2022-04-08 02:22:02,469 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:22:02,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c [2022-04-08 02:22:02,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b7bf14f/0a3ed200d8f24bf0a62cc918d14dfeef/FLAGaf6a78e04 [2022-04-08 02:22:02,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b7bf14f/0a3ed200d8f24bf0a62cc918d14dfeef [2022-04-08 02:22:02,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:22:02,906 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:22:02,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:22:02,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:22:02,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:22:02,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:22:02" (1/1) ... [2022-04-08 02:22:02,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74370af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:02, skipping insertion in model container [2022-04-08 02:22:02,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:22:02" (1/1) ... [2022-04-08 02:22:02,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:22:02,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:22:03,056 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/ps4-ll_unwindbound2.c[458,471] [2022-04-08 02:22:03,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:22:03,080 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:22:03,091 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/ps4-ll_unwindbound2.c[458,471] [2022-04-08 02:22:03,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:22:03,110 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:22:03,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03 WrapperNode [2022-04-08 02:22:03,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:22:03,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:22:03,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:22:03,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:22:03,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:22:03,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:22:03,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:22:03,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:22:03,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:22:03,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:22:03,163 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-08 02:22:03,167 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-08 02:22:03,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:22:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:22:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:22:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 02:22:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 02:22:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:22:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:22:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:22:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:22:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:22:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 02:22:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:22:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:22:03,250 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:22:03,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:22:03,347 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:22:03,352 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:22:03,352 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:22:03,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:22:03 BoogieIcfgContainer [2022-04-08 02:22:03,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:22:03,355 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:22:03,355 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:22:03,357 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:22:03,359 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:22:03" (1/1) ... [2022-04-08 02:22:03,361 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:22:03,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:22:03 BasicIcfg [2022-04-08 02:22:03,379 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:22:03,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:22:03,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:22:03,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:22:03,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:22:02" (1/4) ... [2022-04-08 02:22:03,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8be426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:22:03, skipping insertion in model container [2022-04-08 02:22:03,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:22:03" (2/4) ... [2022-04-08 02:22:03,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8be426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:22:03, skipping insertion in model container [2022-04-08 02:22:03,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:22:03" (3/4) ... [2022-04-08 02:22:03,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8be426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:22:03, skipping insertion in model container [2022-04-08 02:22:03,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:22:03" (4/4) ... [2022-04-08 02:22:03,385 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound2.cqvasr [2022-04-08 02:22:03,389 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:22:03,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:22:03,422 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:22:03,429 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 02:22:03,429 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:22:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:22:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 02:22:03,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:22:03,453 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:22:03,454 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:22:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:22:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1984627219, now seen corresponding path program 1 times [2022-04-08 02:22:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:22:03,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511813098] [2022-04-08 02:22:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:22:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:22:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:03,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {26#true} is VALID [2022-04-08 02:22:03,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-08 02:22:03,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-08 02:22:03,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:22:03,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {26#true} is VALID [2022-04-08 02:22:03,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-08 02:22:03,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-08 02:22:03,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-08 02:22:03,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {26#true} is VALID [2022-04-08 02:22:03,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [66] L27-3-->L27-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-08 02:22:03,599 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {27#false} is VALID [2022-04-08 02:22:03,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-08 02:22:03,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-08 02:22:03,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-08 02:22:03,600 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-08 02:22:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:22:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511813098] [2022-04-08 02:22:03,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511813098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:22:03,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:22:03,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 02:22:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681493929] [2022-04-08 02:22:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:22:03,607 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-08 02:22:03,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:22:03,611 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-08 02:22:03,626 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-08 02:22:03,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 02:22:03,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:22:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 02:22:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:22:03,645 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-08 02:22:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:03,816 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-08 02:22:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 02:22:03,817 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-08 02:22:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:22:03,818 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-08 02:22:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 02:22:03,836 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-08 02:22:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 02:22:03,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-08 02:22:03,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:03,945 INFO L225 Difference]: With dead ends: 41 [2022-04-08 02:22:03,945 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 02:22:03,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:22:03,952 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:22:03,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:22:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 02:22:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 02:22:03,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:22:03,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:03,980 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:03,981 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:03,988 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 02:22:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 02:22:03,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:03,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:03,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-08 02:22:03,989 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-08 02:22:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:03,996 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 02:22:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 02:22:03,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:03,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:03,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:22:03,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:22:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-08 02:22:03,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-08 02:22:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:22:04,000 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-08 02:22:04,000 INFO L479 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-08 02:22:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 02:22:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 02:22:04,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:22:04,001 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:22:04,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:22:04,001 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:22:04,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:22:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1423332195, now seen corresponding path program 1 times [2022-04-08 02:22:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:22:04,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983570362] [2022-04-08 02:22:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:22:04,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:22:04,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702646146] [2022-04-08 02:22:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:04,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:22:04,036 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-08 02:22:04,042 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-08 02:22:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:04,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 02:22:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:04,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:22:04,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-08 02:22:04,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {163#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:04,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:04,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#(<= ~counter~0 0)} {155#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:04,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:04,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {163#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:04,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {179#(<= |main_#t~post5| 0)} is VALID [2022-04-08 02:22:04,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {156#false} is VALID [2022-04-08 02:22:04,311 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {156#false} is VALID [2022-04-08 02:22:04,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {156#false} is VALID [2022-04-08 02:22:04,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {156#false} is VALID [2022-04-08 02:22:04,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#false} is VALID [2022-04-08 02:22:04,312 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-08 02:22:04,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:22:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:22:04,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983570362] [2022-04-08 02:22:04,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:22:04,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702646146] [2022-04-08 02:22:04,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702646146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:22:04,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:22:04,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:22:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484909477] [2022-04-08 02:22:04,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:22:04,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-08 02:22:04,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:22:04,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 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-08 02:22:04,332 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-08 02:22:04,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:22:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:22:04,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:22:04,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:22:04,333 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 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-08 02:22:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:04,382 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 02:22:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:22:04,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-08 02:22:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:22:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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-08 02:22:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 02:22:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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-08 02:22:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 02:22:04,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-08 02:22:04,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:04,413 INFO L225 Difference]: With dead ends: 28 [2022-04-08 02:22:04,413 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 02:22:04,413 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:22:04,414 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:22:04,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:22:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 02:22:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 02:22:04,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:22:04,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:04,421 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:04,421 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:04,423 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 02:22:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 02:22:04,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:04,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:04,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 02:22:04,424 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 02:22:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:04,425 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 02:22:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 02:22:04,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:04,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:04,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:22:04,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:22:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-08 02:22:04,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-08 02:22:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:22:04,428 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-08 02:22:04,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-08 02:22:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 02:22:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 02:22:04,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:22:04,429 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:22:04,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 02:22:04,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:04,644 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:22:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:22:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404671, now seen corresponding path program 1 times [2022-04-08 02:22:04,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:22:04,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616878364] [2022-04-08 02:22:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:04,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:22:04,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:22:04,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260942732] [2022-04-08 02:22:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:04,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:22:04,661 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-08 02:22:04,685 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-08 02:22:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:04,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:22:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:04,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:22:04,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-08 02:22:04,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {305#true} is VALID [2022-04-08 02:22:04,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-08 02:22:04,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-08 02:22:04,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-08 02:22:04,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:04,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:04,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:04,852 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:22:04,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:22:04,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-08 02:22:04,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-08 02:22:04,854 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-08 02:22:04,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:22:04,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:22:04,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616878364] [2022-04-08 02:22:04,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:22:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260942732] [2022-04-08 02:22:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260942732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:22:04,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:22:04,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:22:04,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128036383] [2022-04-08 02:22:04,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:22:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 02:22:04,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:22:04,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:22:04,868 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-08 02:22:04,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:22:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:22:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:22:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:22:04,869 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:22:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:04,989 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 02:22:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:22:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 02:22:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:22:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:22:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 02:22:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:22:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 02:22:04,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 02:22:05,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:05,036 INFO L225 Difference]: With dead ends: 30 [2022-04-08 02:22:05,036 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 02:22:05,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-08 02:22:05,040 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:22:05,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:22:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 02:22:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 02:22:05,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:22:05,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,052 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,052 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:05,060 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 02:22:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 02:22:05,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:05,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:05,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 02:22:05,061 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 02:22:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:05,068 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 02:22:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 02:22:05,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:05,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:05,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:22:05,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:22:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 02:22:05,073 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-08 02:22:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:22:05,073 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 02:22:05,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:22:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 02:22:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:22:05,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:22:05,077 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:22:05,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 02:22:05,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 02:22:05,292 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:22:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:22:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash -381498108, now seen corresponding path program 1 times [2022-04-08 02:22:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:22:05,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395311885] [2022-04-08 02:22:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:22:05,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:22:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190985161] [2022-04-08 02:22:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:05,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:05,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:22:05,312 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-08 02:22:05,347 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-08 02:22:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:05,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:22:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:05,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:22:05,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-08 02:22:05,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,539 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,541 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {505#(<= ~counter~0 1)} {505#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {530#(<= |main_#t~post5| 1)} is VALID [2022-04-08 02:22:05,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {482#false} is VALID [2022-04-08 02:22:05,543 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {482#false} is VALID [2022-04-08 02:22:05,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {482#false} is VALID [2022-04-08 02:22:05,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-08 02:22:05,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-08 02:22:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:22:05,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:22:05,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-08 02:22:05,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-08 02:22:05,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {482#false} is VALID [2022-04-08 02:22:05,679 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {482#false} is VALID [2022-04-08 02:22:05,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 2)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {482#false} is VALID [2022-04-08 02:22:05,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {530#(<= |main_#t~post5| 1)} is VALID [2022-04-08 02:22:05,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,682 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {505#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-08 02:22:05,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-08 02:22:05,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-08 02:22:05,685 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {481#true} is VALID [2022-04-08 02:22:05,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:22:05,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {489#(<= ~counter~0 0)} is VALID [2022-04-08 02:22:05,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-08 02:22:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:22:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:22:05,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395311885] [2022-04-08 02:22:05,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:22:05,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190985161] [2022-04-08 02:22:05,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190985161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:22:05,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:22:05,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-08 02:22:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507855776] [2022-04-08 02:22:05,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:22:05,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-08 02:22:05,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:22:05,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:22:05,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:05,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:22:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:22:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:22:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:22:05,712 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:22:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:05,794 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-08 02:22:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 02:22:05,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-08 02:22:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:22:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:22:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 02:22:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:22:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 02:22:05,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 02:22:05,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:05,849 INFO L225 Difference]: With dead ends: 36 [2022-04-08 02:22:05,849 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 02:22:05,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:22:05,853 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:22:05,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:22:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 02:22:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 02:22:05,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:22:05,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,865 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,865 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:05,867 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 02:22:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 02:22:05,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:05,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:05,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 02:22:05,867 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 02:22:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:05,869 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 02:22:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 02:22:05,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:05,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:05,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:22:05,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:22:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-08 02:22:05,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-08 02:22:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:22:05,871 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-08 02:22:05,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:22:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 02:22:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:22:05,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:22:05,872 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:22:05,896 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-08 02:22:06,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:06,092 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:22:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:22:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash -380425632, now seen corresponding path program 1 times [2022-04-08 02:22:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:22:06,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548605321] [2022-04-08 02:22:06,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:22:06,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:22:06,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590953586] [2022-04-08 02:22:06,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:06,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:06,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:22:06,109 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-08 02:22:06,111 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-08 02:22:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:06,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 02:22:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:06,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:22:06,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {756#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {756#true} is VALID [2022-04-08 02:22:06,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {756#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {756#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:06,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:06,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:06,305 INFO L272 TraceCheckUtils]: 8: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {756#true} is VALID [2022-04-08 02:22:06,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {756#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {756#true} is VALID [2022-04-08 02:22:06,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {756#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {756#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,306 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {756#true} {776#(and (= main_~x~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {776#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:06,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 02:22:06,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 02:22:06,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 02:22:06,309 INFO L272 TraceCheckUtils]: 16: Hoare triple {801#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:22:06,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {811#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:22:06,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {815#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {757#false} is VALID [2022-04-08 02:22:06,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {757#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#false} is VALID [2022-04-08 02:22:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:22:06,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:22:06,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {757#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {757#false} is VALID [2022-04-08 02:22:06,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {815#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {757#false} is VALID [2022-04-08 02:22:06,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {811#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:22:06,536 INFO L272 TraceCheckUtils]: 16: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:22:06,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 02:22:06,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 02:22:06,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 02:22:06,817 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {756#true} {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 02:22:06,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {756#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {756#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {756#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {756#true} is VALID [2022-04-08 02:22:06,817 INFO L272 TraceCheckUtils]: 8: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {756#true} is VALID [2022-04-08 02:22:06,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 02:22:06,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 02:22:06,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {756#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {831#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 02:22:06,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {756#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {756#true} is VALID [2022-04-08 02:22:06,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {756#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {756#true} is VALID [2022-04-08 02:22:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 02:22:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:22:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548605321] [2022-04-08 02:22:06,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:22:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590953586] [2022-04-08 02:22:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590953586] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 02:22:06,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:22:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 02:22:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632510227] [2022-04-08 02:22:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:22:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2022-04-08 02:22:06,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:22:06,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 02:22:07,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:07,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:22:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:22:07,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:22:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 02:22:07,312 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 02:22:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:07,406 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-08 02:22:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:22:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2022-04-08 02:22:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:22:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 02:22:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 02:22:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 02:22:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 02:22:07,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-08 02:22:07,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:07,887 INFO L225 Difference]: With dead ends: 34 [2022-04-08 02:22:07,887 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 02:22:07,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:22:07,888 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:22:07,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:22:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 02:22:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 02:22:07,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:22:07,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:07,899 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:07,899 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:07,900 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 02:22:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 02:22:07,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:07,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:07,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 02:22:07,902 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 02:22:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:07,903 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 02:22:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 02:22:07,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:07,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:07,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:22:07,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:22:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-08 02:22:07,905 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-08 02:22:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:22:07,905 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-08 02:22:07,905 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 02:22:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 02:22:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:22:07,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:22:07,906 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:22:07,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 02:22:08,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:08,111 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:22:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:22:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1647871298, now seen corresponding path program 1 times [2022-04-08 02:22:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:22:08,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010960984] [2022-04-08 02:22:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:22:08,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:22:08,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428257945] [2022-04-08 02:22:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:08,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:08,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:22:08,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:22:08,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 02:22:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:08,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 02:22:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:22:08,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:22:08,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {1032#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-08 02:22:08,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) 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] {1032#true} is VALID [2022-04-08 02:22:08,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-08 02:22:08,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#true} {1032#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-08 02:22:08,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-08 02:22:08,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:08,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:08,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:08,579 INFO L272 TraceCheckUtils]: 8: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1032#true} is VALID [2022-04-08 02:22:08,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1032#true} is VALID [2022-04-08 02:22:08,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {1032#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-08 02:22:08,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {1032#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#true} is VALID [2022-04-08 02:22:08,580 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1032#true} {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:22:08,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {1052#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:22:08,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:22:08,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 2) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:22:08,582 INFO L272 TraceCheckUtils]: 16: Hoare triple {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1032#true} is VALID [2022-04-08 02:22:08,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1090#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:22:08,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {1090#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:22:08,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:22:08,584 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1094#(not (= |__VERIFIER_assert_#in~cond| 0))} {1077#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1101#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:22:08,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {1101#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {1105#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:22:08,586 INFO L272 TraceCheckUtils]: 22: Hoare triple {1105#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1109#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:22:08,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {1109#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1113#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:22:08,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {1113#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-08 02:22:08,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {1033#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#false} is VALID [2022-04-08 02:22:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 02:22:08,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:22:27,164 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 13) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0))))) (not (= (mod (+ .cse1 .cse2 .cse3) 4) 0)) (not (<= (div (+ .cse1 .cse2 .cse3 (- 4)) (- 4)) (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))))))) is different from false [2022-04-08 02:22:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:22:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010960984] [2022-04-08 02:22:29,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:22:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428257945] [2022-04-08 02:22:29,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428257945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:22:29,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:22:29,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 02:22:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219474776] [2022-04-08 02:22:29,275 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:22:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 02:22:29,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:22:29,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:29,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:29,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 02:22:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:22:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 02:22:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2022-04-08 02:22:29,297 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:29,614 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 02:22:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 02:22:29,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 02:22:29,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:22:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-08 02:22:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-08 02:22:29,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-08 02:22:29,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:22:29,646 INFO L225 Difference]: With dead ends: 36 [2022-04-08 02:22:29,647 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 02:22:29,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=66, Invalid=209, Unknown=1, NotChecked=30, Total=306 [2022-04-08 02:22:29,648 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:22:29,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:22:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 02:22:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 02:22:29,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:22:29,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:29,661 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:29,661 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:29,662 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 02:22:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 02:22:29,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:29,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:29,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 02:22:29,662 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 02:22:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:22:29,663 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 02:22:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 02:22:29,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:22:29,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:22:29,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:22:29,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:22:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 02:22:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 02:22:29,665 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-08 02:22:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:22:29,666 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 02:22:29,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 02:22:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 02:22:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:22:29,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:22:29,666 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:22:29,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 02:22:29,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:29,880 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:22:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:22:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash -382724699, now seen corresponding path program 2 times [2022-04-08 02:22:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:22:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104455958] [2022-04-08 02:22:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:22:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:22:29,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:22:29,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040044033] [2022-04-08 02:22:29,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:22:29,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:22:29,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:22:29,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 02:22:29,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:22:29,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 02:22:29,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 02:22:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 02:22:29,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 02:22:29,981 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 02:22:29,982 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:22:30,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 02:22:30,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:22:30,186 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-04-08 02:22:30,188 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 02:22:30,219 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:22:30,220 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:22:30,220 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-08 02:22:30,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:22:30 BasicIcfg [2022-04-08 02:22:30,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:22:30,221 INFO L158 Benchmark]: Toolchain (without parser) took 27315.22ms. Allocated memory was 180.4MB in the beginning and 226.5MB in the end (delta: 46.1MB). Free memory was 130.0MB in the beginning and 139.0MB in the end (delta: -8.9MB). Peak memory consumption was 37.4MB. Max. memory is 8.0GB. [2022-04-08 02:22:30,222 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:22:30,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.49ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 158.5MB in the end (delta: -28.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 02:22:30,222 INFO L158 Benchmark]: Boogie Preprocessor took 22.90ms. Allocated memory is still 180.4MB. Free memory was 158.5MB in the beginning and 157.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 02:22:30,222 INFO L158 Benchmark]: RCFGBuilder took 219.12ms. Allocated memory is still 180.4MB. Free memory was 157.1MB in the beginning and 146.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 02:22:30,222 INFO L158 Benchmark]: IcfgTransformer took 24.31ms. Allocated memory is still 180.4MB. Free memory was 146.6MB in the beginning and 144.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 02:22:30,223 INFO L158 Benchmark]: TraceAbstraction took 26840.34ms. Allocated memory was 180.4MB in the beginning and 226.5MB in the end (delta: 46.1MB). Free memory was 144.5MB in the beginning and 139.0MB in the end (delta: 5.6MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2022-04-08 02:22:30,224 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.11ms. Allocated memory is still 180.4MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.49ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 158.5MB in the end (delta: -28.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.90ms. Allocated memory is still 180.4MB. Free memory was 158.5MB in the beginning and 157.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 219.12ms. Allocated memory is still 180.4MB. Free memory was 157.1MB in the beginning and 146.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 24.31ms. Allocated memory is still 180.4MB. Free memory was 146.6MB in the beginning and 144.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 26840.34ms. Allocated memory was 180.4MB in the beginning and 226.5MB in the end (delta: 46.1MB). Free memory was 144.5MB in the beginning and 139.0MB in the end (delta: 5.6MB). Peak memory consumption was 52.1MB. 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: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; VAL [\old(counter)=10, counter=0] [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [\old(counter)=0, c=0, counter=0, k=3, x=0, y=0] [L27] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=3, x=0, y=0] [L27] COND TRUE counter++<2 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=0, counter=1, k=3, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=1, counter=1, k=3, x=1, y=1] [L27] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=3, x=1, y=1] [L27] COND TRUE counter++<2 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=1, counter=2, k=3, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=2, counter=2, k=3, x=9, y=2] [L27] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=3, x=9, y=2] [L27] COND FALSE !(counter++<2) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L10] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L12] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 375 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 117 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 9 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 18/30 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-08 02:22:30,239 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...