/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/geo2-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:21:14,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:21:14,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:21:14,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:21:14,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:21:14,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:21:14,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:21:14,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:21:14,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:21:14,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:21:14,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:21:15,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:21:15,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:21:15,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:21:15,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:21:15,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:21:15,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:21:15,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:21:15,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:21:15,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:21:15,012 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:21:15,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:21:15,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:21:15,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:21:15,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:21:15,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:21:15,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:21:15,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:21:15,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:21:15,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:21:15,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:21:15,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:21:15,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:21:15,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:21:15,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:21:15,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:21:15,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:21:15,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:21:15,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:21:15,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:21:15,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:21:15,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:21:15,027 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:21:15,049 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:21:15,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:21:15,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:21:15,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:21:15,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:21:15,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:21:15,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:21:15,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:21:15,051 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:21:15,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:21:15,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:21:15,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:21:15,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:21:15,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:21:15,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:21:15,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:21:15,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:21:15,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:21:15,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:21:15,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:21:15,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:21:15,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:21:15,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:21:15,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:21:15,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:15,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:21:15,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:21:15,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:21:15,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:21:15,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:21:15,055 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:21:15,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:21:15,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:21:15,055 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:21:15,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:21:15,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:21:15,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:21:15,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:21:15,265 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:21:15,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound1.c [2022-04-27 13:21:15,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17380c77d/dd135a63e2134c1f8d4111258bcb7b1f/FLAG8743918ae [2022-04-27 13:21:15,690 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:21:15,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound1.c [2022-04-27 13:21:15,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17380c77d/dd135a63e2134c1f8d4111258bcb7b1f/FLAG8743918ae [2022-04-27 13:21:15,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17380c77d/dd135a63e2134c1f8d4111258bcb7b1f [2022-04-27 13:21:15,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:21:15,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:21:15,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:15,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:21:15,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:21:15,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0739d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15, skipping insertion in model container [2022-04-27 13:21:15,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:21:15,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:21:15,884 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/geo2-ll_unwindbound1.c[525,538] [2022-04-27 13:21:15,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:15,913 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:21:15,927 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/geo2-ll_unwindbound1.c[525,538] [2022-04-27 13:21:15,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:15,940 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:21:15,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15 WrapperNode [2022-04-27 13:21:15,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:15,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:21:15,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:21:15,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:21:15,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:21:15,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:21:15,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:21:15,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:21:15,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (1/1) ... [2022-04-27 13:21:15,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:15,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:16,029 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:21:16,046 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:21:16,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:21:16,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:21:16,063 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:21:16,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:21:16,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:21:16,064 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:21:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:21:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:21:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:21:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:21:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:21:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:21:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:21:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:21:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:21:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:21:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:21:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:21:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:21:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:21:16,118 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:21:16,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:21:16,253 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:21:16,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:21:16,257 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:21:16,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:16 BoogieIcfgContainer [2022-04-27 13:21:16,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:21:16,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:21:16,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:21:16,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:21:16,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:21:15" (1/3) ... [2022-04-27 13:21:16,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c37a59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:16, skipping insertion in model container [2022-04-27 13:21:16,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:15" (2/3) ... [2022-04-27 13:21:16,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c37a59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:16, skipping insertion in model container [2022-04-27 13:21:16,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:16" (3/3) ... [2022-04-27 13:21:16,282 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_unwindbound1.c [2022-04-27 13:21:16,291 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:21:16,291 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:21:16,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:21:16,340 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@4c8caf71, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@160defcc [2022-04-27 13:21:16,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:21:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 13:21:16,350 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:16,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:16,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-27 13:21:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:16,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613632985] [2022-04-27 13:21:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:21:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:16,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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; {25#true} is VALID [2022-04-27 13:21:16,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 13:21:16,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 13:21:16,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:21:16,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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; {25#true} is VALID [2022-04-27 13:21:16,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 13:21:16,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 13:21:16,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret7 := main(); {25#true} is VALID [2022-04-27 13:21:16,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#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;~x~0 := 1;~y~0 := 1;~c~0 := 1; {25#true} is VALID [2022-04-27 13:21:16,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 13:21:16,558 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-27 13:21:16,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 13:21:16,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 13:21:16,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 13:21:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:16,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613632985] [2022-04-27 13:21:16,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613632985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:16,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:16,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:21:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346612698] [2022-04-27 13:21:16,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:16,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 13:21:16,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:16,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:16,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:16,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:21:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:21:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:16,603 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:16,695 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-27 13:21:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:21:16,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 13:21:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 13:21:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 13:21:16,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 13:21:16,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:16,778 INFO L225 Difference]: With dead ends: 39 [2022-04-27 13:21:16,778 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 13:21:16,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:16,783 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:16,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 13:21:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-27 13:21:16,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:16,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:16,808 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:16,808 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:16,811 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 13:21:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 13:21:16,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:16,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:16,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 13:21:16,812 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 13:21:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:16,814 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 13:21:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 13:21:16,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:16,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:16,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:16,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 13:21:16,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 13:21:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:16,828 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 13:21:16,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 13:21:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:16,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:16,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:16,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:21:16,830 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-27 13:21:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:16,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683784531] [2022-04-27 13:21:16,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:16,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:16,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940397318] [2022-04-27 13:21:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:16,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:16,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:16,843 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:21:16,883 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:21:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:16,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:21:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:16,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:17,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2022-04-27 13:21:17,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:17,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#(<= ~counter~0 0)} assume true; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:17,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#(<= ~counter~0 0)} {146#true} #54#return; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:17,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#(<= ~counter~0 0)} call #t~ret7 := main(); {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:17,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= ~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;~x~0 := 1;~y~0 := 1;~c~0 := 1; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:17,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:21:17,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {147#false} is VALID [2022-04-27 13:21:17,087 INFO L272 TraceCheckUtils]: 8: Hoare triple {147#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {147#false} is VALID [2022-04-27 13:21:17,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#false} ~cond := #in~cond; {147#false} is VALID [2022-04-27 13:21:17,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {147#false} assume 0 == ~cond; {147#false} is VALID [2022-04-27 13:21:17,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 13:21:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:17,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:17,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683784531] [2022-04-27 13:21:17,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:17,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940397318] [2022-04-27 13:21:17,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940397318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:17,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:17,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:21:17,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835665374] [2022-04-27 13:21:17,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:17,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:21:17,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:17,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:17,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:21:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:21:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:21:17,099 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:17,144 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 13:21:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:21:17,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:21:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 13:21:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 13:21:17,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 13:21:17,168 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:21:17,169 INFO L225 Difference]: With dead ends: 26 [2022-04-27 13:21:17,170 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 13:21:17,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:21:17,171 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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:21:17,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 13:21:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 13:21:17,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:17,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:17,175 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:17,176 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:17,177 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:17,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:17,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:17,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-27 13:21:17,178 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-27 13:21:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:17,179 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:17,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:17,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:17,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:17,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 13:21:17,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-27 13:21:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:17,181 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 13:21:17,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:17,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:17,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:17,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:21:17,397 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:21:17,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-27 13:21:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:17,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137718504] [2022-04-27 13:21:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:17,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:17,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027526418] [2022-04-27 13:21:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:17,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:17,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:17,413 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:21:17,414 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:21:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:17,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:21:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:17,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:17,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {288#true} is VALID [2022-04-27 13:21:17,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#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; {288#true} is VALID [2022-04-27 13:21:17,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-27 13:21:17,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #54#return; {288#true} is VALID [2022-04-27 13:21:17,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret7 := main(); {288#true} is VALID [2022-04-27 13:21:17,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#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;~x~0 := 1;~y~0 := 1;~c~0 := 1; {308#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:17,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {308#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:17,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 1);havoc #t~post6; {308#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:17,575 INFO L272 TraceCheckUtils]: 8: Hoare triple {308#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:17,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:17,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {289#false} is VALID [2022-04-27 13:21:17,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-27 13:21:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:17,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:17,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137718504] [2022-04-27 13:21:17,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:17,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027526418] [2022-04-27 13:21:17,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027526418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:17,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:17,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:21:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531545258] [2022-04-27 13:21:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:21:17,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:17,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:17,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:21:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:17,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:21:17,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:21:17,596 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:17,674 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 13:21:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:17,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:21:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 13:21:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 13:21:17,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-27 13:21:17,698 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:21:17,701 INFO L225 Difference]: With dead ends: 28 [2022-04-27 13:21:17,701 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:21:17,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:21:17,704 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:17,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:21:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:21:17,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:17,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:17,717 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:17,717 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:17,719 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:17,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:17,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:17,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 13:21:17,720 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 13:21:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:17,726 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:17,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:17,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:17,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:17,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 13:21:17,730 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-27 13:21:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:17,730 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 13:21:17,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:21:17,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:17,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:17,752 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:21:17,946 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:21:17,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:17,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-27 13:21:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:17,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663774929] [2022-04-27 13:21:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:17,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:17,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444514454] [2022-04-27 13:21:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:17,967 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:21:17,970 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:21:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:18,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:21:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:18,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:18,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 13:21:18,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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#true} is VALID [2022-04-27 13:21:18,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-27 13:21:18,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #54#return; {456#true} is VALID [2022-04-27 13:21:18,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret7 := main(); {456#true} is VALID [2022-04-27 13:21:18,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#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;~x~0 := 1;~y~0 := 1;~c~0 := 1; {476#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:18,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {476#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {476#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:18,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {476#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 1);havoc #t~post6; {476#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:18,173 INFO L272 TraceCheckUtils]: 8: Hoare triple {476#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {456#true} is VALID [2022-04-27 13:21:18,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#true} ~cond := #in~cond; {456#true} is VALID [2022-04-27 13:21:18,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#true} assume !(0 == ~cond); {456#true} is VALID [2022-04-27 13:21:18,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-27 13:21:18,179 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {456#true} {476#(and (= main_~y~0 1) (= main_~x~0 1))} #50#return; {476#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:18,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {476#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {501#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-27 13:21:18,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {501#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {501#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-27 13:21:18,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {501#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} assume !(#t~post6 < 1);havoc #t~post6; {501#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-27 13:21:18,182 INFO L272 TraceCheckUtils]: 16: Hoare triple {501#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:18,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:18,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {457#false} is VALID [2022-04-27 13:21:18,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 13:21:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:18,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:18,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 13:21:18,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {457#false} is VALID [2022-04-27 13:21:18,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:18,485 INFO L272 TraceCheckUtils]: 16: Hoare triple {531#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:18,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {531#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !(#t~post6 < 1);havoc #t~post6; {531#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:18,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:18,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {531#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:18,489 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {456#true} {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} #50#return; {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:18,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-27 13:21:18,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#true} assume !(0 == ~cond); {456#true} is VALID [2022-04-27 13:21:18,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#true} ~cond := #in~cond; {456#true} is VALID [2022-04-27 13:21:18,490 INFO L272 TraceCheckUtils]: 8: Hoare triple {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {456#true} is VALID [2022-04-27 13:21:18,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(#t~post6 < 1);havoc #t~post6; {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:18,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:18,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#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;~x~0 := 1;~y~0 := 1;~c~0 := 1; {541#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:18,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret7 := main(); {456#true} is VALID [2022-04-27 13:21:18,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #54#return; {456#true} is VALID [2022-04-27 13:21:18,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-27 13:21:18,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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#true} is VALID [2022-04-27 13:21:18,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 13:21:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:18,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:18,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663774929] [2022-04-27 13:21:18,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444514454] [2022-04-27 13:21:18,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444514454] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:21:18,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:21:18,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 13:21:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23397538] [2022-04-27 13:21:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:18,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:21:18,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:18,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:18,513 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:21:18,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:21:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:18,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:21:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:21:18,514 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:18,581 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:18,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:21:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 13:21:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 13:21:18,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-27 13:21:18,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:18,612 INFO L225 Difference]: With dead ends: 25 [2022-04-27 13:21:18,612 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:21:18,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:21:18,613 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:18,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:21:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:21:18,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:18,614 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:21:18,614 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:21:18,614 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:21:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:18,614 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:18,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:18,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:18,614 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:21:18,628 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:21:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:18,628 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:18,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:18,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:18,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:18,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:18,629 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:21:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:21:18,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-27 13:21:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:18,629 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:21:18,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:18,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:18,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:21:18,650 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:21:18,832 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:21:18,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:21:18,888 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 13:21:18,888 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 13:21:18,888 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 13:21:18,888 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:18,888 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 13:21:18,889 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:18,889 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:18,889 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-04-27 13:21:18,889 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))) [2022-04-27 13:21:18,890 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))) [2022-04-27 13:21:18,890 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 24 46) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:21:18,890 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 46) no Hoare annotation was computed. [2022-04-27 13:21:18,890 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 46) no Hoare annotation was computed. [2022-04-27 13:21:18,890 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-27 13:21:18,890 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))) [2022-04-27 13:21:18,890 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-04-27 13:21:18,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:18,890 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:21:18,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:18,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:18,891 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-27 13:21:18,891 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:21:18,891 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:18,891 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 13:21:18,891 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 13:21:18,891 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 13:21:18,891 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:18,891 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:18,891 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 13:21:18,893 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 13:21:18,895 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:21:18,897 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:21:18,897 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:18,898 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:21:18,900 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:18,900 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:21:18,900 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:18,900 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:18,900 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:18,900 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:21:18,901 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:18,902 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:18,902 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:18,902 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:21:18,902 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:18,902 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:18,902 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:21:18,902 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:21:18,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:21:18 BoogieIcfgContainer [2022-04-27 13:21:18,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:21:18,912 INFO L158 Benchmark]: Toolchain (without parser) took 3203.06ms. Allocated memory was 188.7MB in the beginning and 251.7MB in the end (delta: 62.9MB). Free memory was 132.6MB in the beginning and 214.7MB in the end (delta: -82.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:18,912 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 188.7MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:18,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.13ms. Allocated memory was 188.7MB in the beginning and 251.7MB in the end (delta: 62.9MB). Free memory was 132.4MB in the beginning and 222.1MB in the end (delta: -89.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-27 13:21:18,914 INFO L158 Benchmark]: Boogie Preprocessor took 31.69ms. Allocated memory is still 251.7MB. Free memory was 222.1MB in the beginning and 221.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:21:18,914 INFO L158 Benchmark]: RCFGBuilder took 284.63ms. Allocated memory is still 251.7MB. Free memory was 221.1MB in the beginning and 209.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:18,914 INFO L158 Benchmark]: TraceAbstraction took 2651.28ms. Allocated memory is still 251.7MB. Free memory was 208.5MB in the beginning and 214.7MB in the end (delta: -6.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:18,915 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.31ms. Allocated memory is still 188.7MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.13ms. Allocated memory was 188.7MB in the beginning and 251.7MB in the end (delta: 62.9MB). Free memory was 132.4MB in the beginning and 222.1MB in the end (delta: -89.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.69ms. Allocated memory is still 251.7MB. Free memory was 222.1MB in the beginning and 221.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 284.63ms. Allocated memory is still 251.7MB. Free memory was 221.1MB in the beginning and 209.5MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2651.28ms. Allocated memory is still 251.7MB. Free memory was 208.5MB in the beginning and 214.7MB in the end (delta: -6.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 69 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 71 HoareAnnotationTreeSize, 14 FomulaSimplifications, 41 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 11 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 275 SizeOfPredicates, 4 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6/8 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: 34]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || x + z * y == z * x + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 13:21:18,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...