/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:45:03,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:45:03,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:45:03,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:45:03,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:45:03,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:45:03,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:45:03,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:45:03,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:45:03,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:45:03,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:45:03,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:45:03,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:45:03,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:45:03,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:45:03,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:45:03,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:45:03,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:45:03,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:45:03,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:45:03,113 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:45:03,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:45:03,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:45:03,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:45:03,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:45:03,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:45:03,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:45:03,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:45:03,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:45:03,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:45:03,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:45:03,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:45:03,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:45:03,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:45:03,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:45:03,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:45:03,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:45:03,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:45:03,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:45:03,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:45:03,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:45:03,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:45:03,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:45:03,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:45:03,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:45:03,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:45:03,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:45:03,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:45:03,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:45:03,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:45:03,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:45:03,138 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:45:03,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:45:03,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:45:03,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:03,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:45:03,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 11:45:03,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:45:03,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:45:03,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:45:03,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:45:03,345 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:45:03,346 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 11:45:03,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cffadfa/b4e1f0f171d441f9a6da4e971f89dfa3/FLAG8e38170a6 [2022-04-27 11:45:03,745 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:45:03,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i [2022-04-27 11:45:03,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cffadfa/b4e1f0f171d441f9a6da4e971f89dfa3/FLAG8e38170a6 [2022-04-27 11:45:03,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cffadfa/b4e1f0f171d441f9a6da4e971f89dfa3 [2022-04-27 11:45:03,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:45:03,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:45:03,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:03,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:45:03,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:45:03,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:03,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7345f7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03, skipping insertion in model container [2022-04-27 11:45:03,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:03,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:45:03,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:45:03,926 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 11:45:03,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:03,965 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:45:03,979 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 11:45:03,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:03,992 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:45:03,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03 WrapperNode [2022-04-27 11:45:03,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:03,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:45:03,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:45:03,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:45:04,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:45:04,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:45:04,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:45:04,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:45:04,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (1/1) ... [2022-04-27 11:45:04,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:04,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:04,041 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 11:45:04,061 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 11:45:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:45:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:45:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:45:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:45:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:45:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:45:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:45:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:45:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:45:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:45:04,114 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:45:04,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:45:04,206 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:45:04,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:45:04,210 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:45:04,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:04 BoogieIcfgContainer [2022-04-27 11:45:04,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:45:04,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:45:04,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:45:04,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:45:04,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:45:03" (1/3) ... [2022-04-27 11:45:04,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b77943e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:04, skipping insertion in model container [2022-04-27 11:45:04,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:03" (2/3) ... [2022-04-27 11:45:04,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b77943e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:04, skipping insertion in model container [2022-04-27 11:45:04,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:04" (3/3) ... [2022-04-27 11:45:04,217 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark52_polynomial.i [2022-04-27 11:45:04,227 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:45:04,227 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:45:04,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:45:04,262 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=PETRI_NET, 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@7d1dc236, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@118d91b8 [2022-04-27 11:45:04,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:45:04,267 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 11:45:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:45:04,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:04,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:04,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-27 11:45:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:04,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894837972] [2022-04-27 11:45:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:04,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:45:04,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528095637] [2022-04-27 11:45:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:04,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:04,354 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 11:45:04,355 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 11:45:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:04,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 11:45:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:04,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:04,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2022-04-27 11:45:04,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); {23#true} is VALID [2022-04-27 11:45:04,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:45:04,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:45:04,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-27 11:45:04,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2022-04-27 11:45:04,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~i~0 < 10 && ~i~0 > -10); {46#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} is VALID [2022-04-27 11:45:04,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} assume !(~i~0 * ~i~0 < 100); {24#false} is VALID [2022-04-27 11:45:04,549 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if 10 == ~i~0 then 1 else 0)); {24#false} is VALID [2022-04-27 11:45:04,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:45:04,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:45:04,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:45:04,550 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 11:45:04,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:45:04,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:04,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894837972] [2022-04-27 11:45:04,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:45:04,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528095637] [2022-04-27 11:45:04,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528095637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:04,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:04,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:45:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180707538] [2022-04-27 11:45:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:04,556 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 11:45:04,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:04,559 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 11:45:04,569 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 11:45:04,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:45:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:04,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:45:04,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:45:04,583 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), 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 11:45:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:04,623 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:45:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:45:04,624 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 11:45:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:04,625 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 11:45:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 11:45:04,632 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 11:45:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 11:45:04,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-27 11:45:04,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:04,680 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:45:04,680 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:45:04,682 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 11:45:04,685 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:04,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:45:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:45:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:45:04,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:04,710 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 11:45:04,710 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 11:45:04,710 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 11:45:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:04,715 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:45:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:45:04,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:04,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:04,716 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 11:45:04,716 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 11:45:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:04,719 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:45:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:45:04,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:04,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:04,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:04,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:04,722 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 11:45:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 11:45:04,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 11:45:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:04,728 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 11:45:04,728 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 11:45:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:45:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:45:04,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:04,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:04,749 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 11:45:04,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 11:45:04,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-27 11:45:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:04,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467583009] [2022-04-27 11:45:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:04,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:45:04,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841870665] [2022-04-27 11:45:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:04,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:04,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:04,957 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 11:45:04,959 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 11:45:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:05,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:45:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:05,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:05,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {154#true} is VALID [2022-04-27 11:45:05,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); {154#true} is VALID [2022-04-27 11:45:05,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-27 11:45:05,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #45#return; {154#true} is VALID [2022-04-27 11:45:05,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret2 := main(); {154#true} is VALID [2022-04-27 11:45:05,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {154#true} is VALID [2022-04-27 11:45:05,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#true} assume !!(~i~0 < 10 && ~i~0 > -10); {177#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} is VALID [2022-04-27 11:45:05,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} assume !!(~i~0 * ~i~0 < 100);~i~0 := 1 + ~i~0; {181#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)))} is VALID [2022-04-27 11:45:05,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {181#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)))} assume !(~i~0 * ~i~0 < 100); {185#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} is VALID [2022-04-27 11:45:05,298 INFO L272 TraceCheckUtils]: 9: Hoare triple {185#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} call __VERIFIER_assert((if 10 == ~i~0 then 1 else 0)); {189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:05,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:05,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {155#false} is VALID [2022-04-27 11:45:05,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-27 11:45:05,299 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 11:45:05,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:05,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-27 11:45:05,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {155#false} is VALID [2022-04-27 11:45:05,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:05,434 INFO L272 TraceCheckUtils]: 9: Hoare triple {185#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} call __VERIFIER_assert((if 10 == ~i~0 then 1 else 0)); {189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:05,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#(or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (< (* main_~i~0 main_~i~0) 100))} assume !(~i~0 * ~i~0 < 100); {185#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} is VALID [2022-04-27 11:45:05,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(or (and (< 0 (+ main_~i~0 10)) (< main_~i~0 10)) (< (+ (* main_~i~0 main_~i~0) (* main_~i~0 2)) 99))} assume !!(~i~0 * ~i~0 < 100);~i~0 := 1 + ~i~0; {212#(or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (< (* main_~i~0 main_~i~0) 100))} is VALID [2022-04-27 11:45:05,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#true} assume !!(~i~0 < 10 && ~i~0 > -10); {216#(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 11:45:05,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {154#true} is VALID [2022-04-27 11:45:05,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret2 := main(); {154#true} is VALID [2022-04-27 11:45:05,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #45#return; {154#true} is VALID [2022-04-27 11:45:05,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-27 11:45:05,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); {154#true} is VALID [2022-04-27 11:45:05,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {154#true} is VALID [2022-04-27 11:45:05,437 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 11:45:05,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:05,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467583009] [2022-04-27 11:45:05,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:45:05,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841870665] [2022-04-27 11:45:05,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841870665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:45:05,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:45:05,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-27 11:45:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251851382] [2022-04-27 11:45:05,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:05,439 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 11:45:05,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:05,439 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 11:45:05,451 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 11:45:05,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:45:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:45:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:45:05,452 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 11:45:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:05,563 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:45:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:45:05,563 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 11:45:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:05,563 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 11:45:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-27 11:45:05,564 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 11:45:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-27 11:45:05,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-27 11:45:05,583 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 11:45:05,583 INFO L225 Difference]: With dead ends: 14 [2022-04-27 11:45:05,583 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:45:05,583 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 11:45:05,585 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:05,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:45:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:45:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:45:05,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:05,587 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 11:45:05,587 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 11:45:05,587 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 11:45:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:05,588 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:45:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:45:05,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:05,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:05,588 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 11:45:05,588 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 11:45:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:05,588 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:45:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:45:05,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:05,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:05,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:05,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:05,589 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 11:45:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:45:05,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 11:45:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:05,589 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:45:05,589 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 11:45:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:45:05,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:05,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:45:05,609 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 11:45:05,809 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,SelfDestructingSolverStorable1 [2022-04-27 11:45:05,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:45:05,839 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:45:05,839 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:45:05,839 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:45:05,839 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 27) the Hoare annotation is: true [2022-04-27 11:45:05,839 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-04-27 11:45:05,839 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 27) no Hoare annotation was computed. [2022-04-27 11:45:05,839 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-04-27 11:45:05,839 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 11:45:05,840 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 11:45:05,840 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 27) no Hoare annotation was computed. [2022-04-27 11:45:05,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:45:05,840 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:45:05,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:45:05,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:45:05,840 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:45:05,840 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:45:05,840 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:45:05,840 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:45:05,840 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:45:05,840 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:45:05,870 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:45:05,870 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:45:05,870 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:45:05,873 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 11:45:05,874 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:45:05,878 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:45:05,879 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:45:05,879 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:45:05,879 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:45:05,879 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:45:05,879 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:45:05,879 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:45:05,884 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:45:05,885 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:45:05,885 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:45:05,885 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:45:05,885 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:45:05,885 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:45:05,885 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:45:05,885 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 11:45:05,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:45:05 BoogieIcfgContainer [2022-04-27 11:45:05,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:45:05,899 INFO L158 Benchmark]: Toolchain (without parser) took 2130.98ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 117.6MB in the beginning and 180.4MB in the end (delta: -62.8MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. [2022-04-27 11:45:05,900 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 174.1MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:45:05,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.89ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 117.4MB in the beginning and 181.7MB in the end (delta: -64.3MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-04-27 11:45:05,901 INFO L158 Benchmark]: Boogie Preprocessor took 24.66ms. Allocated memory is still 209.7MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:45:05,901 INFO L158 Benchmark]: RCFGBuilder took 192.41ms. Allocated memory is still 209.7MB. Free memory was 180.1MB in the beginning and 168.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:45:05,901 INFO L158 Benchmark]: TraceAbstraction took 1680.04ms. Allocated memory is still 209.7MB. Free memory was 168.1MB in the beginning and 180.4MB in the end (delta: -12.3MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. [2022-04-27 11:45:05,902 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.24ms. Allocated memory is still 174.1MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.89ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 117.4MB in the beginning and 181.7MB in the end (delta: -64.3MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.66ms. Allocated memory is still 209.7MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 192.41ms. Allocated memory is still 209.7MB. Free memory was 180.1MB in the beginning and 168.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1680.04ms. Allocated memory is still 209.7MB. Free memory was 168.1MB in the beginning and 180.4MB in the end (delta: -12.3MB). Peak memory consumption was 96.7MB. 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 28 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 10 NumberOfFragments, 39 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 2 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 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 11:45:05,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...