/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/loop-zilu/benchmark52_polynomial.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:36:27,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:36:27,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:36:27,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:36:27,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:36:27,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:36:27,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:36:27,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:36:27,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:36:27,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:36:27,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:36:27,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:36:27,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:36:27,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:36:27,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:36:27,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:36:27,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:36:27,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:36:27,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:36:27,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:36:27,846 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:36:27,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:36:27,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:36:27,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:36:27,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:36:27,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:36:27,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:36:27,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:36:27,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:36:27,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:36:27,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:36:27,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:36:27,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:36:27,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:36:27,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:36:27,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:36:27,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:36:27,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:36:27,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:36:27,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:36:27,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:36:27,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:36:27,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:36:27,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:36:27,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:36:27,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:36:27,887 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:36:27,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:36:27,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:36:27,888 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:36:27,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:36:27,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:36:27,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:36:27,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:36:27,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:36:27,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:36:27,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:36:27,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:36:27,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:36:27,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:36:27,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:36:27,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:36:27,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:36:27,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:36:27,892 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:36:27,892 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 22:36:28,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:36:28,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:36:28,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:36:28,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:36:28,080 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:36:28,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i [2022-04-27 22:36:28,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7376cbbe3/995ea98a2a0a4632a770fd9a81155dde/FLAG36eb79793 [2022-04-27 22:36:28,495 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:36:28,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i [2022-04-27 22:36:28,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7376cbbe3/995ea98a2a0a4632a770fd9a81155dde/FLAG36eb79793 [2022-04-27 22:36:28,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7376cbbe3/995ea98a2a0a4632a770fd9a81155dde [2022-04-27 22:36:28,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:36:28,923 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:36:28,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:36:28,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:36:28,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:36:28,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:36:28" (1/1) ... [2022-04-27 22:36:28,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99a5340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:28, skipping insertion in model container [2022-04-27 22:36:28,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:36:28" (1/1) ... [2022-04-27 22:36:28,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:36:28,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:36:29,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i[872,885] [2022-04-27 22:36:29,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:36:29,063 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:36:29,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i[872,885] [2022-04-27 22:36:29,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:36:29,123 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:36:29,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29 WrapperNode [2022-04-27 22:36:29,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:36:29,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:36:29,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:36:29,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:36:29,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:36:29,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:36:29,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:36:29,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:36:29,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:36:29,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:36:29,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:36:29,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:36:29,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:36:29,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:36:29,238 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:36:29,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:36:29,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:36:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:36:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 22:36:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:36:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:36:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:36:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:36:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:36:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:36:29,289 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:36:29,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:36:29,402 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:36:29,406 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:36:29,406 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:36:29,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:36:29 BoogieIcfgContainer [2022-04-27 22:36:29,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:36:29,408 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:36:29,408 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:36:29,423 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:36:29,425 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:36:29" (1/1) ... [2022-04-27 22:36:29,426 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:36:29,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:36:29 BasicIcfg [2022-04-27 22:36:29,445 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:36:29,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:36:29,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:36:29,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:36:29,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:36:28" (1/4) ... [2022-04-27 22:36:29,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd17e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:36:29, skipping insertion in model container [2022-04-27 22:36:29,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:36:29" (2/4) ... [2022-04-27 22:36:29,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd17e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:36:29, skipping insertion in model container [2022-04-27 22:36:29,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:36:29" (3/4) ... [2022-04-27 22:36:29,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd17e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:36:29, skipping insertion in model container [2022-04-27 22:36:29,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:36:29" (4/4) ... [2022-04-27 22:36:29,462 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark52_polynomial.iqvasr [2022-04-27 22:36:29,470 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:36:29,471 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:36:29,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:36:29,518 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ba32286, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f6040fb [2022-04-27 22:36:29,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:36:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 22:36:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:36:29,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:36:29,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:36:29,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:36:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:36:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-27 22:36:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:36:29,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740738969] [2022-04-27 22:36:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:36:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:29,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:36:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:29,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 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{#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[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 22:36:29,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:36:29,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:36:29,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:36:29,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 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{#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[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 22:36:29,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:36:29,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:36:29,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:36:29,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0] {23#true} is VALID [2022-04-27 22:36:29,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L21-->L22-2: Formula: (and (< 0 (+ v_main_~i~0_7 10)) (< v_main_~i~0_7 10)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:36:29,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L22-2-->L22-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 22:36:29,692 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_8 10) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {24#false} is VALID [2022-04-27 22:36:29,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 22:36:29,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 22:36:29,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 22:36:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:36:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:36:29,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740738969] [2022-04-27 22:36:29,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740738969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:36:29,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:36:29,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:36:29,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185473070] [2022-04-27 22:36:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:36:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:36:29,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:36:29,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:29,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:36:29,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:36:29,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:36:29,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:36:29,744 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:29,805 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 22:36:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:36:29,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:36:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:36:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 22:36:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 22:36:29,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-27 22:36:29,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:29,883 INFO L225 Difference]: With dead ends: 32 [2022-04-27 22:36:29,883 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 22:36:29,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:36:29,887 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:36:29,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:36:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 22:36:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 22:36:29,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:36:29,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,911 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,911 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:29,916 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 22:36:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:36:29,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:29,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:29,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-27 22:36:29,917 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-27 22:36:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:29,919 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 22:36:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:36:29,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:29,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:29,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:36:29,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:36:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 22:36:29,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-27 22:36:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:36:29,929 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 22:36:29,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:36:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:36:29,930 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:36:29,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:36:29,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:36:29,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:36:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:36:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-27 22:36:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:36:29,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494876297] [2022-04-27 22:36:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:36:29,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:36:29,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145137941] [2022-04-27 22:36:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:36:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:36:29,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:36:29,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:36:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:30,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 22:36:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:30,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:36:30,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:36:30,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 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{#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[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-27 22:36:30,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:36:30,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:36:30,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:36:30,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [52] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0] {118#true} is VALID [2022-04-27 22:36:30,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [55] L21-->L22-2: Formula: (and (< 0 (+ v_main_~i~0_7 10)) (< v_main_~i~0_7 10)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {141#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} is VALID [2022-04-27 22:36:30,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} [58] L22-2-->L22-3: Formula: (not (< (* v_main_~i~0_1 v_main_~i~0_1) 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 22:36:30,152 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [60] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_8 10) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {119#false} is VALID [2022-04-27 22:36:30,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {119#false} is VALID [2022-04-27 22:36:30,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 22:36:30,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 22:36:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:36:30,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:36:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:36:30,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494876297] [2022-04-27 22:36:30,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:36:30,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145137941] [2022-04-27 22:36:30,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145137941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:36:30,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:36:30,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:36:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182609845] [2022-04-27 22:36:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:36:30,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-27 22:36:30,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:36:30,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-27 22:36:30,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:30,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:36:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:36:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:36:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:36:30,164 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-27 22:36:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:30,182 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 22:36:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:36:30,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-27 22:36:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:36:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-27 22:36:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-04-27 22:36:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-27 22:36:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-04-27 22:36:30,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2022-04-27 22:36:30,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:30,197 INFO L225 Difference]: With dead ends: 19 [2022-04-27 22:36:30,197 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 22:36:30,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:36:30,198 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:36:30,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:36:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 22:36:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 22:36:30,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:36:30,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:30,202 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:30,202 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:30,203 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 22:36:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 22:36:30,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:30,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:30,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 22:36:30,204 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 22:36:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:30,205 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 22:36:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 22:36:30,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:30,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:30,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:36:30,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:36:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:36:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 22:36:30,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 22:36:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:36:30,206 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 22:36:30,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-27 22:36:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 22:36:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 22:36:30,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:36:30,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:36:30,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:36:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:36:30,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:36:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:36:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-27 22:36:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:36:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408797830] [2022-04-27 22:36:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:36:30,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:36:30,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270135826] [2022-04-27 22:36:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:36:30,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:36:30,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:36:30,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:36:30,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:36:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:30,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 22:36:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:36:30,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:36:30,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {235#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 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{#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[#NULL.offset, #NULL.base] {235#true} is VALID [2022-04-27 22:36:30,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#true} {235#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#true} [52] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0] {235#true} is VALID [2022-04-27 22:36:30,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {235#true} [55] L21-->L22-2: Formula: (and (< 0 (+ v_main_~i~0_7 10)) (< v_main_~i~0_7 10)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {258#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} is VALID [2022-04-27 22:36:30,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {258#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} [59] L22-2-->L22-2: Formula: (and (< (* v_main_~i~0_3 v_main_~i~0_3) 100) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[main_~i~0] {262#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)))} is VALID [2022-04-27 22:36:30,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {262#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)))} [58] L22-2-->L22-3: Formula: (not (< (* v_main_~i~0_1 v_main_~i~0_1) 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {266#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} is VALID [2022-04-27 22:36:30,783 INFO L272 TraceCheckUtils]: 9: Hoare triple {266#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} [60] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_8 10) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:36:30,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:36:30,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {236#false} is VALID [2022-04-27 22:36:30,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {236#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#false} is VALID [2022-04-27 22:36:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:36:30,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:36:30,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {236#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#false} is VALID [2022-04-27 22:36:30,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {236#false} is VALID [2022-04-27 22:36:30,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:36:30,944 INFO L272 TraceCheckUtils]: 9: Hoare triple {266#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} [60] L22-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_8 10) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:36:30,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (< (* main_~i~0 main_~i~0) 100))} [58] L22-2-->L22-3: Formula: (not (< (* v_main_~i~0_1 v_main_~i~0_1) 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {266#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} is VALID [2022-04-27 22:36:30,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(or (and (< 0 (+ main_~i~0 10)) (< main_~i~0 10)) (< (+ (* main_~i~0 main_~i~0) (* main_~i~0 2)) 99))} [59] L22-2-->L22-2: Formula: (and (< (* v_main_~i~0_3 v_main_~i~0_3) 100) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[main_~i~0] {293#(or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (< (* main_~i~0 main_~i~0) 100))} is VALID [2022-04-27 22:36:30,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {235#true} [55] L21-->L22-2: Formula: (and (< 0 (+ v_main_~i~0_7 10)) (< v_main_~i~0_7 10)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {297#(or (and (< 0 (+ main_~i~0 10)) (< main_~i~0 10)) (< (+ (* main_~i~0 main_~i~0) (* main_~i~0 2)) 99))} is VALID [2022-04-27 22:36:30,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#true} [52] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0] {235#true} is VALID [2022-04-27 22:36:30,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#true} {235#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 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{#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[#NULL.offset, #NULL.base] {235#true} is VALID [2022-04-27 22:36:30,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {235#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#true} is VALID [2022-04-27 22:36:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:36:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:36:30,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408797830] [2022-04-27 22:36:30,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:36:30,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270135826] [2022-04-27 22:36:30,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270135826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:36:30,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:36:30,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-27 22:36:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863339781] [2022-04-27 22:36:30,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 22:36:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 13 [2022-04-27 22:36:30,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:36:30,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-27 22:36:30,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:30,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 22:36:30,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:36:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 22:36:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:36:30,964 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-27 22:36:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:31,039 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 22:36:31,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:36:31,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 13 [2022-04-27 22:36:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:36:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-27 22:36:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-27 22:36:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-27 22:36:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-27 22:36:31,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-27 22:36:31,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:36:31,053 INFO L225 Difference]: With dead ends: 14 [2022-04-27 22:36:31,053 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:36:31,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:36:31,054 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:36:31,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:36:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:36:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:36:31,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:36:31,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:36:31,055 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:36:31,055 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:36:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:31,055 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:36:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:36:31,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:31,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:31,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:36:31,066 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:36:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:36:31,066 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:36:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:36:31,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:31,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:36:31,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:36:31,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:36:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:36:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:36:31,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 22:36:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:36:31,067 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:36:31,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-27 22:36:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:36:31,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:36:31,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:36:31,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 22:36:31,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 22:36:31,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:36:31,318 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:36:31,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:36:31,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:36:31,318 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:36:31,318 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:36:31,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 27) the Hoare annotation is: true [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 27) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 24) the Hoare annotation is: (or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))) [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 27) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100))) [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 22:36:31,319 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 22:36:31,337 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 22:36:31,338 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:36:31,341 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:36:31,347 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 22:36:31,347 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 22:36:31,347 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 22:36:31,347 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:36:31,347 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:36:31,347 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:36:31,347 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:36:31,347 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:36:31,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:36:31 BasicIcfg [2022-04-27 22:36:31,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:36:31,354 INFO L158 Benchmark]: Toolchain (without parser) took 2430.34ms. Allocated memory was 204.5MB in the beginning and 277.9MB in the end (delta: 73.4MB). Free memory was 146.2MB in the beginning and 241.6MB in the end (delta: -95.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:36:31,354 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 204.5MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:36:31,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.67ms. Allocated memory was 204.5MB in the beginning and 277.9MB in the end (delta: 73.4MB). Free memory was 146.1MB in the beginning and 249.8MB in the end (delta: -103.8MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. [2022-04-27 22:36:31,354 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 277.9MB. Free memory was 249.3MB in the beginning and 248.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:36:31,355 INFO L158 Benchmark]: RCFGBuilder took 255.26ms. Allocated memory is still 277.9MB. Free memory was 248.2MB in the beginning and 236.7MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 22:36:31,355 INFO L158 Benchmark]: IcfgTransformer took 37.28ms. Allocated memory is still 277.9MB. Free memory was 236.7MB in the beginning and 235.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:36:31,355 INFO L158 Benchmark]: TraceAbstraction took 1906.44ms. Allocated memory is still 277.9MB. Free memory was 234.6MB in the beginning and 241.6MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:36:31,356 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.08ms. Allocated memory is still 204.5MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.67ms. Allocated memory was 204.5MB in the beginning and 277.9MB in the end (delta: 73.4MB). Free memory was 146.1MB in the beginning and 249.8MB in the end (delta: -103.8MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 277.9MB. Free memory was 249.3MB in the beginning and 248.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.26ms. Allocated memory is still 277.9MB. Free memory was 248.2MB in the beginning and 236.7MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 37.28ms. Allocated memory is still 277.9MB. Free memory was 236.7MB in the beginning and 235.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1906.44ms. Allocated memory is still 277.9MB. Free memory was 234.6MB in the beginning and 241.6MB in the end (delta: -6.9MB). There was no memory consumed. 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 40 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 45 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 2 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (i < 11 && 0 < i + 9) || (0 < i + 10 && i < 10) RESULT: Ultimate proved your program to be correct! [2022-04-27 22:36:31,394 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...