/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/nla-digbench-scaling/geo1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:20:29,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:20:29,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:20:29,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:20:29,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:20:29,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:20:29,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:20:29,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:20:29,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:20:29,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:20:29,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:20:29,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:20:29,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:20:29,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:20:29,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:20:29,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:20:29,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:20:29,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:20:29,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:20:29,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:20:29,831 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:20:29,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:20:29,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:20:29,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:20:29,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:20:29,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:20:29,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:20:29,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:20:29,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:20:29,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:20:29,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:20:29,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:20:29,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:20:29,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:20:29,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:20:29,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:20:29,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:20:29,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:20:29,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:20:29,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:20:29,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:20:29,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:20:29,846 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 13:20:29,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:20:29,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:20:29,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:20:29,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:20:29,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:20:29,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:20:29,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:20:29,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:20:29,866 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:20:29,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:20:29,867 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:20:29,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:20:29,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:20:29,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:20:29,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:20:29,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:20:29,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:20:29,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:20:29,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:20:29,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:20:29,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:20:29,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:20:29,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:20:29,873 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:20:29,873 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:20:29,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:20:29,874 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 13:20:30,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:20:30,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:20:30,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:20:30,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:20:30,059 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:20:30,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound20.c [2022-04-27 13:20:30,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c530df65/426d0d2dab2e4133a95e01b79bab6d7f/FLAG27910a3c7 [2022-04-27 13:20:30,402 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:20:30,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound20.c [2022-04-27 13:20:30,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c530df65/426d0d2dab2e4133a95e01b79bab6d7f/FLAG27910a3c7 [2022-04-27 13:20:30,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c530df65/426d0d2dab2e4133a95e01b79bab6d7f [2022-04-27 13:20:30,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:20:30,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:20:30,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:20:30,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:20:30,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:20:30,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:20:30" (1/1) ... [2022-04-27 13:20:30,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d19403a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:30, skipping insertion in model container [2022-04-27 13:20:30,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:20:30" (1/1) ... [2022-04-27 13:20:30,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:20:30,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:20:30,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound20.c[546,559] [2022-04-27 13:20:30,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:20:31,000 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:20:31,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound20.c[546,559] [2022-04-27 13:20:31,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:20:31,019 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:20:31,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31 WrapperNode [2022-04-27 13:20:31,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:20:31,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:20:31,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:20:31,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:20:31,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:20:31,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:20:31,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:20:31,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:20:31,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (1/1) ... [2022-04-27 13:20:31,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:20:31,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:31,076 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 13:20:31,088 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 13:20:31,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:20:31,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:20:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:20:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:20:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:20:31,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:20:31,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:20:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:20:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:20:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:20:31,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:20:31,142 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:20:31,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:20:31,237 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:20:31,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:20:31,241 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:20:31,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:20:31 BoogieIcfgContainer [2022-04-27 13:20:31,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:20:31,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:20:31,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:20:31,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:20:31,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:20:30" (1/3) ... [2022-04-27 13:20:31,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a92c6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:20:31, skipping insertion in model container [2022-04-27 13:20:31,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:20:31" (2/3) ... [2022-04-27 13:20:31,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a92c6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:20:31, skipping insertion in model container [2022-04-27 13:20:31,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:20:31" (3/3) ... [2022-04-27 13:20:31,247 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound20.c [2022-04-27 13:20:31,255 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:20:31,255 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:20:31,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:20:31,286 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@64bbdc99, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2159d5b6 [2022-04-27 13:20:31,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:20:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:20:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:20:31,296 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:31,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:31,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 730417173, now seen corresponding path program 1 times [2022-04-27 13:20:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:31,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274797423] [2022-04-27 13:20:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:20:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:31,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 13:20:31,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 13:20:31,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-27 13:20:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:20:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:31,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:20:31,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:20:31,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:20:31,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-27 13:20:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 13:20:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:31,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:20:31,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:20:31,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:20:31,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-27 13:20:31,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:20:31,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 13:20:31,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 13:20:31,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-27 13:20:31,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 13:20:31,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-27 13:20:31,482 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {33#true} is VALID [2022-04-27 13:20:31,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:20:31,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:20:31,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:20:31,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-27 13:20:31,483 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {33#true} is VALID [2022-04-27 13:20:31,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:20:31,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:20:31,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:20:31,495 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-27 13:20:31,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {34#false} is VALID [2022-04-27 13:20:31,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34#false} is VALID [2022-04-27 13:20:31,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} assume !!(#t~post6 < 20);havoc #t~post6; {34#false} is VALID [2022-04-27 13:20:31,495 INFO L272 TraceCheckUtils]: 19: Hoare triple {34#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {34#false} is VALID [2022-04-27 13:20:31,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:20:31,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 13:20:31,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 13:20:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:20:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274797423] [2022-04-27 13:20:31,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274797423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:20:31,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:20:31,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:20:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486176990] [2022-04-27 13:20:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:20:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:20:31,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:31,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:31,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:31,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:20:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:31,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:20:31,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:20:31,541 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:31,624 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-04-27 13:20:31,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:20:31,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:20:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 13:20:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 13:20:31,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-27 13:20:31,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:31,697 INFO L225 Difference]: With dead ends: 54 [2022-04-27 13:20:31,698 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 13:20:31,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 13:20:31,704 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:31,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:20:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 13:20:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 13:20:31,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:31,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:20:31,736 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:20:31,737 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:20:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:31,748 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 13:20:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 13:20:31,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:31,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:31,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 13:20:31,749 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 13:20:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:31,752 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 13:20:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 13:20:31,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:31,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:31,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:31,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:20:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 13:20:31,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2022-04-27 13:20:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:31,755 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 13:20:31,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 13:20:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:20:31,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:31,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:31,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:20:31,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash -942473515, now seen corresponding path program 1 times [2022-04-27 13:20:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:31,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621764859] [2022-04-27 13:20:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:31,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:31,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175354229] [2022-04-27 13:20:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:31,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:31,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:31,809 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 13:20:31,826 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 13:20:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:31,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:20:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:31,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:20:32,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {209#true} is VALID [2022-04-27 13:20:32,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {209#true} is VALID [2022-04-27 13:20:32,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#true} assume true; {209#true} is VALID [2022-04-27 13:20:32,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {209#true} {209#true} #62#return; {209#true} is VALID [2022-04-27 13:20:32,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {209#true} call #t~ret7 := main(); {209#true} is VALID [2022-04-27 13:20:32,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {209#true} is VALID [2022-04-27 13:20:32,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {209#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {209#true} is VALID [2022-04-27 13:20:32,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#true} ~cond := #in~cond; {209#true} is VALID [2022-04-27 13:20:32,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#true} assume !(0 == ~cond); {209#true} is VALID [2022-04-27 13:20:32,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#true} assume true; {209#true} is VALID [2022-04-27 13:20:32,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {209#true} {209#true} #54#return; {209#true} is VALID [2022-04-27 13:20:32,040 INFO L272 TraceCheckUtils]: 11: Hoare triple {209#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {209#true} is VALID [2022-04-27 13:20:32,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#true} ~cond := #in~cond; {209#true} is VALID [2022-04-27 13:20:32,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#true} assume !(0 == ~cond); {209#true} is VALID [2022-04-27 13:20:32,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#true} assume true; {209#true} is VALID [2022-04-27 13:20:32,042 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {209#true} {209#true} #56#return; {209#true} is VALID [2022-04-27 13:20:32,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {209#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:20:32,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:20:32,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:20:32,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:20:32,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {272#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:32,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {276#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {210#false} is VALID [2022-04-27 13:20:32,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-04-27 13:20:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:20:32,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:20:32,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:32,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621764859] [2022-04-27 13:20:32,048 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:32,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175354229] [2022-04-27 13:20:32,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175354229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:20:32,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:20:32,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:20:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396717254] [2022-04-27 13:20:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:20:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:20:32,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:32,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:20:32,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:20:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:20:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:20:32,072 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:20:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:32,163 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 13:20:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:20:32,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:20:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:20:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 13:20:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:20:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 13:20:32,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 13:20:32,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:32,196 INFO L225 Difference]: With dead ends: 36 [2022-04-27 13:20:32,196 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:20:32,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:20:32,197 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:32,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:20:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:20:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 13:20:32,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:32,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,202 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,202 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:32,204 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 13:20:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-27 13:20:32,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:32,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:32,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 13:20:32,205 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 13:20:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:32,206 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 13:20:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-27 13:20:32,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:32,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:32,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:32,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 13:20:32,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 13:20:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:32,209 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 13:20:32,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:20:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 13:20:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 13:20:32,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:32,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:32,236 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 13:20:32,436 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 13:20:32,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash 769172850, now seen corresponding path program 1 times [2022-04-27 13:20:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:32,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859397073] [2022-04-27 13:20:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:32,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:32,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015603769] [2022-04-27 13:20:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:32,477 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 13:20:32,479 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 13:20:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:32,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:20:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:32,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:20:32,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {448#true} call ULTIMATE.init(); {448#true} is VALID [2022-04-27 13:20:32,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {448#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#(<= ~counter~0 0)} assume true; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#(<= ~counter~0 0)} {448#true} #62#return; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#(<= ~counter~0 0)} call #t~ret7 := main(); {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {456#(<= ~counter~0 0)} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= ~counter~0 0)} ~cond := #in~cond; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(<= ~counter~0 0)} assume !(0 == ~cond); {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(<= ~counter~0 0)} assume true; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {456#(<= ~counter~0 0)} {456#(<= ~counter~0 0)} #54#return; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,693 INFO L272 TraceCheckUtils]: 11: Hoare triple {456#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#(<= ~counter~0 0)} ~cond := #in~cond; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {456#(<= ~counter~0 0)} assume !(0 == ~cond); {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= ~counter~0 0)} assume true; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,694 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {456#(<= ~counter~0 0)} {456#(<= ~counter~0 0)} #56#return; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {456#(<= ~counter~0 0)} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {456#(<= ~counter~0 0)} is VALID [2022-04-27 13:20:32,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {456#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {505#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:20:32,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {449#false} is VALID [2022-04-27 13:20:32,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {449#false} ~x~0 := ~x~0 * (~z~0 - 1); {449#false} is VALID [2022-04-27 13:20:32,696 INFO L272 TraceCheckUtils]: 20: Hoare triple {449#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {449#false} is VALID [2022-04-27 13:20:32,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {449#false} ~cond := #in~cond; {449#false} is VALID [2022-04-27 13:20:32,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {449#false} assume 0 == ~cond; {449#false} is VALID [2022-04-27 13:20:32,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {449#false} assume !false; {449#false} is VALID [2022-04-27 13:20:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:20:32,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:20:32,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:32,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859397073] [2022-04-27 13:20:32,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:32,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015603769] [2022-04-27 13:20:32,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015603769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:20:32,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:20:32,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:20:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008039863] [2022-04-27 13:20:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:20:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 13:20:32,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:32,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:32,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:32,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:20:32,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:32,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:20:32,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:20:32,721 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:32,773 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 13:20:32,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:20:32,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 13:20:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:20:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:20:32,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 13:20:32,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:32,809 INFO L225 Difference]: With dead ends: 40 [2022-04-27 13:20:32,809 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:20:32,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:20:32,812 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:32,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:20:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:20:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:20:32,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:32,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,828 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,829 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:32,834 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 13:20:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 13:20:32,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:32,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:32,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 13:20:32,837 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 13:20:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:32,838 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 13:20:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 13:20:32,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:32,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:32,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:32,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:20:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 13:20:32,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2022-04-27 13:20:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:32,841 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 13:20:32,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:20:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 13:20:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:20:32,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:32,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:32,861 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 13:20:33,042 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 13:20:33,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 431121724, now seen corresponding path program 1 times [2022-04-27 13:20:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:33,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406395100] [2022-04-27 13:20:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:33,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:33,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703883138] [2022-04-27 13:20:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:33,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:33,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:33,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:20:33,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:20:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:33,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:20:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:33,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:20:36,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2022-04-27 13:20:36,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {689#true} is VALID [2022-04-27 13:20:36,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 13:20:36,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} #62#return; {689#true} is VALID [2022-04-27 13:20:36,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} call #t~ret7 := main(); {689#true} is VALID [2022-04-27 13:20:36,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {689#true} is VALID [2022-04-27 13:20:36,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {689#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {689#true} is VALID [2022-04-27 13:20:36,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 13:20:36,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 13:20:36,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 13:20:36,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {689#true} {689#true} #54#return; {689#true} is VALID [2022-04-27 13:20:36,447 INFO L272 TraceCheckUtils]: 11: Hoare triple {689#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {689#true} is VALID [2022-04-27 13:20:36,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 13:20:36,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 13:20:36,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 13:20:36,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {689#true} {689#true} #56#return; {689#true} is VALID [2022-04-27 13:20:36,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {689#true} is VALID [2022-04-27 13:20:36,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {689#true} is VALID [2022-04-27 13:20:36,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#true} assume !!(#t~post6 < 20);havoc #t~post6; {689#true} is VALID [2022-04-27 13:20:36,448 INFO L272 TraceCheckUtils]: 19: Hoare triple {689#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {689#true} is VALID [2022-04-27 13:20:36,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#true} ~cond := #in~cond; {754#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:36,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {754#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:20:36,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:20:36,452 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} {689#true} #58#return; {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:20:36,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:20:36,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {772#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-27 13:20:36,458 INFO L272 TraceCheckUtils]: 26: Hoare triple {772#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:20:36,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:36,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {690#false} is VALID [2022-04-27 13:20:36,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {690#false} assume !false; {690#false} is VALID [2022-04-27 13:20:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:20:36,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:20:38,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {690#false} assume !false; {690#false} is VALID [2022-04-27 13:20:38,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {690#false} is VALID [2022-04-27 13:20:38,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:20:38,769 INFO L272 TraceCheckUtils]: 26: Hoare triple {796#(= (+ main_~x~0 1) main_~y~0)} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:20:38,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {796#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 13:20:38,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:20:38,771 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} {689#true} #58#return; {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:20:38,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:20:38,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {815#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:20:38,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#true} ~cond := #in~cond; {815#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:20:38,773 INFO L272 TraceCheckUtils]: 19: Hoare triple {689#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {689#true} is VALID [2022-04-27 13:20:38,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#true} assume !!(#t~post6 < 20);havoc #t~post6; {689#true} is VALID [2022-04-27 13:20:38,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {689#true} is VALID [2022-04-27 13:20:38,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {689#true} is VALID [2022-04-27 13:20:38,773 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {689#true} {689#true} #56#return; {689#true} is VALID [2022-04-27 13:20:38,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 13:20:38,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 13:20:38,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 13:20:38,773 INFO L272 TraceCheckUtils]: 11: Hoare triple {689#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {689#true} is VALID [2022-04-27 13:20:38,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {689#true} {689#true} #54#return; {689#true} is VALID [2022-04-27 13:20:38,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 13:20:38,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} assume !(0 == ~cond); {689#true} is VALID [2022-04-27 13:20:38,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} ~cond := #in~cond; {689#true} is VALID [2022-04-27 13:20:38,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {689#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {689#true} is VALID [2022-04-27 13:20:38,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {689#true} is VALID [2022-04-27 13:20:38,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} call #t~ret7 := main(); {689#true} is VALID [2022-04-27 13:20:38,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} #62#return; {689#true} is VALID [2022-04-27 13:20:38,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} assume true; {689#true} is VALID [2022-04-27 13:20:38,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {689#true} is VALID [2022-04-27 13:20:38,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2022-04-27 13:20:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:20:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:20:38,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406395100] [2022-04-27 13:20:38,775 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:20:38,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703883138] [2022-04-27 13:20:38,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703883138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:20:38,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:20:38,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:20:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885816509] [2022-04-27 13:20:38,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:20:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-27 13:20:38,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:20:38,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:20:38,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:38,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:20:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:20:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:20:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:20:38,803 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:20:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:38,995 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 13:20:38,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:20:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-27 13:20:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:20:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 13:20:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:20:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 13:20:38,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-27 13:20:39,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:39,050 INFO L225 Difference]: With dead ends: 32 [2022-04-27 13:20:39,050 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:20:39,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:20:39,051 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:39,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 104 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-04-27 13:20:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:20:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:20:39,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:39,052 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 13:20:39,052 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 13:20:39,052 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 13:20:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:39,052 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:20:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:39,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:39,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:39,052 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 13:20:39,052 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 13:20:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:39,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:20:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:39,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:39,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:39,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:39,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:39,053 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 13:20:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:20:39,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-27 13:20:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:39,053 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:20:39,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:20:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:39,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:39,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:20:39,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:20:39,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:39,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:20:39,347 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-27 13:20:39,347 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-27 13:20:39,347 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-27 13:20:39,347 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-27 13:20:39,347 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-04-27 13:20:39,347 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-04-27 13:20:39,347 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-27 13:20:39,347 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 45) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point L35-4(lines 35 45) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 23 51) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 23 51) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 45) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 51) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:20:39,348 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:20:39,348 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:20:39,348 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (= (+ main_~x~0 1) main_~y~0) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point L49-1(line 49) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 35 45) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:20:39,348 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:20:39,349 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-27 13:20:39,349 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-04-27 13:20:39,349 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-04-27 13:20:39,349 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-04-27 13:20:39,352 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 13:20:39,353 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:20:39,356 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:20:39,356 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:20:39,357 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:20:39,358 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:20:39,359 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:20:39,360 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:20:39,360 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:20:39,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:20:39 BoogieIcfgContainer [2022-04-27 13:20:39,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:20:39,367 INFO L158 Benchmark]: Toolchain (without parser) took 8531.69ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 130.8MB in the beginning and 97.4MB in the end (delta: 33.4MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2022-04-27 13:20:39,367 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 147.2MB in the beginning and 147.2MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:20:39,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.49ms. Allocated memory is still 181.4MB. Free memory was 130.7MB in the beginning and 157.1MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:20:39,368 INFO L158 Benchmark]: Boogie Preprocessor took 22.86ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:20:39,368 INFO L158 Benchmark]: RCFGBuilder took 199.11ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 143.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:20:39,368 INFO L158 Benchmark]: TraceAbstraction took 8122.58ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 143.4MB in the beginning and 97.4MB in the end (delta: 46.0MB). Peak memory consumption was 83.7MB. Max. memory is 8.0GB. [2022-04-27 13:20:39,370 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 147.2MB in the beginning and 147.2MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.49ms. Allocated memory is still 181.4MB. Free memory was 130.7MB in the beginning and 157.1MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.86ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 199.11ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 143.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8122.58ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 143.4MB in the beginning and 97.4MB in the end (delta: 46.0MB). Peak memory consumption was 83.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: 18]: 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 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 101 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 18 PreInvPairs, 24 NumberOfFragments, 78 HoareAnnotationTreeSize, 18 FomulaSimplifications, 37 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 125 ConstructedInterpolants, 1 QuantifiedInterpolants, 272 SizeOfPredicates, 5 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 22/24 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: 35]: Loop Invariant Derived loop invariant: z * x + 1 == y + x || !(\old(counter) <= 0) RESULT: Ultimate proved your program to be correct! [2022-04-27 13:20:39,387 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...