/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/geo3-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:21:57,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:21:57,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:21:57,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:21:57,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:21:57,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:21:57,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:21:57,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:21:57,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:21:57,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:21:57,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:21:57,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:21:57,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:21:57,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:21:57,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:21:57,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:21:57,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:21:57,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:21:57,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:21:57,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:21:57,144 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:21:57,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:21:57,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:21:57,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:21:57,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:21:57,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:21:57,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:21:57,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:21:57,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:21:57,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:21:57,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:21:57,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:21:57,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:21:57,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:21:57,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:21:57,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:21:57,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:21:57,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:21:57,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:21:57,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:21:57,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:21:57,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:21:57,159 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:57,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:21:57,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:21:57,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:21:57,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:21:57,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:21:57,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:21:57,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:21:57,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:21:57,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:21:57,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:21:57,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:57,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:21:57,181 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:21:57,182 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:21:57,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:21:57,182 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:57,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:21:57,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:21:57,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:21:57,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:21:57,388 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:21:57,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound5.c [2022-04-27 13:21:57,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c218b466b/f947048adc484144a9f8eccc3a2be3fd/FLAG1b3f8c3ac [2022-04-27 13:21:57,790 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:21:57,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound5.c [2022-04-27 13:21:57,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c218b466b/f947048adc484144a9f8eccc3a2be3fd/FLAG1b3f8c3ac [2022-04-27 13:21:57,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c218b466b/f947048adc484144a9f8eccc3a2be3fd [2022-04-27 13:21:57,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:21:57,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:21:57,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:57,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:21:57,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:21:57,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:57" (1/1) ... [2022-04-27 13:21:57,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1a28e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:57, skipping insertion in model container [2022-04-27 13:21:57,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:57" (1/1) ... [2022-04-27 13:21:57,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:21:57,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:21:57,934 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/geo3-ll_valuebound5.c[525,538] [2022-04-27 13:21:57,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:57,953 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:21:57,961 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/geo3-ll_valuebound5.c[525,538] [2022-04-27 13:21:57,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:57,973 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:21:57,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:57 WrapperNode [2022-04-27 13:21:57,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:57,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:21:57,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:21:57,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:21:57,980 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:57" (1/1) ... [2022-04-27 13:21:57,980 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:57" (1/1) ... [2022-04-27 13:21:57,984 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:57" (1/1) ... [2022-04-27 13:21:57,984 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:57" (1/1) ... [2022-04-27 13:21:57,987 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:57" (1/1) ... [2022-04-27 13:21:57,990 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:57" (1/1) ... [2022-04-27 13:21:57,990 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:57" (1/1) ... [2022-04-27 13:21:57,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:21:57,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:21:57,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:21:57,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:21:57,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:57" (1/1) ... [2022-04-27 13:21:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:58,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:58,036 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:58,054 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:58,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:21:58,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:21:58,067 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:21:58,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:21:58,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:21:58,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:21:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:21:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:21:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:21:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:21:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:21:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:21:58,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:21:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:21:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:21:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:21:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:21:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:21:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:21:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:21:58,114 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:21:58,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:21:58,225 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:21:58,231 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:21:58,232 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:21:58,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:58 BoogieIcfgContainer [2022-04-27 13:21:58,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:21:58,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:21:58,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:21:58,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:21:58,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:21:57" (1/3) ... [2022-04-27 13:21:58,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f01f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:58, skipping insertion in model container [2022-04-27 13:21:58,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:57" (2/3) ... [2022-04-27 13:21:58,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f01f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:58, skipping insertion in model container [2022-04-27 13:21:58,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:58" (3/3) ... [2022-04-27 13:21:58,261 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound5.c [2022-04-27 13:21:58,271 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:21:58,271 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:21:58,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:21:58,308 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@4bdd6f05, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59267073 [2022-04-27 13:21:58,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:21:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:21:58,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:21:58,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:58,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:58,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash -779299010, now seen corresponding path program 1 times [2022-04-27 13:21:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:58,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310106182] [2022-04-27 13:21:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:21:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:58,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#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); {34#true} is VALID [2022-04-27 13:21:58,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:21:58,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #65#return; {34#true} is VALID [2022-04-27 13:21:58,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:21:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:58,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 13:21:58,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 13:21:58,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 13:21:58,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 13:21:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:21:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:58,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 13:21:58,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 13:21:58,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 13:21:58,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #57#return; {35#false} is VALID [2022-04-27 13:21:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 13:21:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:58,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 13:21:58,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 13:21:58,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 13:21:58,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #59#return; {35#false} is VALID [2022-04-27 13:21:58,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:21:58,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#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); {34#true} is VALID [2022-04-27 13:21:58,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:21:58,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #65#return; {34#true} is VALID [2022-04-27 13:21:58,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-27 13:21:58,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-27 13:21:58,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-27 13:21:58,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 13:21:58,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 13:21:58,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 13:21:58,507 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 13:21:58,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {35#false} is VALID [2022-04-27 13:21:58,508 INFO L272 TraceCheckUtils]: 12: Hoare triple {35#false} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-27 13:21:58,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 13:21:58,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 13:21:58,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 13:21:58,510 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35#false} {35#false} #57#return; {35#false} is VALID [2022-04-27 13:21:58,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {35#false} is VALID [2022-04-27 13:21:58,510 INFO L272 TraceCheckUtils]: 18: Hoare triple {35#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {34#true} is VALID [2022-04-27 13:21:58,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 13:21:58,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 13:21:58,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 13:21:58,513 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35#false} {35#false} #59#return; {35#false} is VALID [2022-04-27 13:21:58,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#false} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {35#false} is VALID [2022-04-27 13:21:58,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 13:21:58,514 INFO L272 TraceCheckUtils]: 25: Hoare triple {35#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-27 13:21:58,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 13:21:58,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 13:21:58,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 13:21:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:21:58,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:58,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310106182] [2022-04-27 13:21:58,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310106182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:58,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:58,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:21:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152786181] [2022-04-27 13:21:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:58,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 13:21:58,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:58,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:21:58,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:58,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:21:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:21:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:58,596 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:21:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:58,706 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-27 13:21:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:21:58,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 13:21:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:21:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-27 13:21:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:21:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-27 13:21:58,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-27 13:21:58,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:58,806 INFO L225 Difference]: With dead ends: 55 [2022-04-27 13:21:58,807 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 13:21:58,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:58,815 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:58,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 13:21:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 13:21:58,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:58,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:58,849 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:58,849 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:58,856 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 13:21:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 13:21:58,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:58,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:58,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-27 13:21:58,857 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-27 13:21:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:58,862 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 13:21:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 13:21:58,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:58,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:58,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:58,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 13:21:58,868 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29 [2022-04-27 13:21:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:58,868 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 13:21:58,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:21:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 13:21:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:21:58,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:58,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:58,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:21:58,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -963850242, now seen corresponding path program 1 times [2022-04-27 13:21:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:58,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776764407] [2022-04-27 13:21:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:58,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:58,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352981693] [2022-04-27 13:21:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:58,911 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:58,912 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:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:58,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:21:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:58,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:59,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2022-04-27 13:21:59,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#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); {218#true} is VALID [2022-04-27 13:21:59,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 13:21:59,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #65#return; {218#true} is VALID [2022-04-27 13:21:59,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret7 := main(); {218#true} is VALID [2022-04-27 13:21:59,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {218#true} is VALID [2022-04-27 13:21:59,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {218#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {218#true} is VALID [2022-04-27 13:21:59,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-04-27 13:21:59,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#true} assume !(0 == ~cond); {218#true} is VALID [2022-04-27 13:21:59,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 13:21:59,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {218#true} {218#true} #55#return; {218#true} is VALID [2022-04-27 13:21:59,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {218#true} is VALID [2022-04-27 13:21:59,157 INFO L272 TraceCheckUtils]: 12: Hoare triple {218#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {218#true} is VALID [2022-04-27 13:21:59,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-04-27 13:21:59,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {218#true} assume !(0 == ~cond); {218#true} is VALID [2022-04-27 13:21:59,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 13:21:59,159 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2022-04-27 13:21:59,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {218#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {218#true} is VALID [2022-04-27 13:21:59,159 INFO L272 TraceCheckUtils]: 18: Hoare triple {218#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {218#true} is VALID [2022-04-27 13:21:59,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-04-27 13:21:59,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {218#true} assume !(0 == ~cond); {218#true} is VALID [2022-04-27 13:21:59,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 13:21:59,160 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {218#true} {218#true} #59#return; {218#true} is VALID [2022-04-27 13:21:59,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {218#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {292#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:59,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {292#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {292#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:59,165 INFO L272 TraceCheckUtils]: 25: Hoare triple {292#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:59,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:59,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {219#false} is VALID [2022-04-27 13:21:59,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-27 13:21:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:21:59,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:59,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:59,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776764407] [2022-04-27 13:21:59,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352981693] [2022-04-27 13:21:59,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352981693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:59,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:59,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:21:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683816459] [2022-04-27 13:21:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:59,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-27 13:21:59,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:59,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:21:59,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:21:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:21:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:21:59,194 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:21:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:59,318 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 13:21:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-27 13:21:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:21:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 13:21:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:21:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 13:21:59,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 13:21:59,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:59,359 INFO L225 Difference]: With dead ends: 36 [2022-04-27 13:21:59,359 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:21:59,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:59,362 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:59,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:21:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 13:21:59,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:59,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:21:59,372 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:21:59,372 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:21:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:59,378 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 13:21:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 13:21:59,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:59,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:59,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 13:21:59,379 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 13:21:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:59,381 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 13:21:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 13:21:59,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:59,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:59,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:59,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:21:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 13:21:59,387 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-04-27 13:21:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:59,387 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 13:21:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:21:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 13:21:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:21:59,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:59,391 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:59,408 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:59,596 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:59,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash -425626518, now seen corresponding path program 1 times [2022-04-27 13:21:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:59,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988359799] [2022-04-27 13:21:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:59,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:59,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299974282] [2022-04-27 13:21:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:59,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:59,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:59,637 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:59,640 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:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:59,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 13:21:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:59,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:59,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-27 13:21:59,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#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); {477#true} is VALID [2022-04-27 13:21:59,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:21:59,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #65#return; {477#true} is VALID [2022-04-27 13:21:59,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret7 := main(); {477#true} is VALID [2022-04-27 13:21:59,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {477#true} is VALID [2022-04-27 13:21:59,964 INFO L272 TraceCheckUtils]: 6: Hoare triple {477#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {477#true} is VALID [2022-04-27 13:21:59,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-04-27 13:21:59,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-04-27 13:21:59,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:21:59,964 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {477#true} {477#true} #55#return; {477#true} is VALID [2022-04-27 13:21:59,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {477#true} is VALID [2022-04-27 13:21:59,965 INFO L272 TraceCheckUtils]: 12: Hoare triple {477#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {477#true} is VALID [2022-04-27 13:21:59,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-04-27 13:21:59,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-04-27 13:21:59,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:21:59,966 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {477#true} {477#true} #57#return; {477#true} is VALID [2022-04-27 13:21:59,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {477#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {477#true} is VALID [2022-04-27 13:21:59,967 INFO L272 TraceCheckUtils]: 18: Hoare triple {477#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {477#true} is VALID [2022-04-27 13:21:59,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-04-27 13:21:59,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-04-27 13:21:59,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:21:59,967 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {477#true} {477#true} #59#return; {477#true} is VALID [2022-04-27 13:21:59,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {477#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {551#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:59,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {551#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {551#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:59,968 INFO L272 TraceCheckUtils]: 25: Hoare triple {551#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {477#true} is VALID [2022-04-27 13:21:59,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {477#true} ~cond := #in~cond; {561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:59,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:59,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:59,972 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} {551#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {551#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:59,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {551#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {575#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:59,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {575#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {575#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:59,975 INFO L272 TraceCheckUtils]: 32: Hoare triple {575#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:59,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:59,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {478#false} is VALID [2022-04-27 13:21:59,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-27 13:21:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:21:59,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:22:12,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-27 13:22:12,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {478#false} is VALID [2022-04-27 13:22:12,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:22:12,857 INFO L272 TraceCheckUtils]: 32: Hoare triple {602#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:22:12,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {602#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {602#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-27 13:22:12,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {609#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {602#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-27 13:22:12,900 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} {477#true} #61#return; {609#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-27 13:22:12,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:12,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {622#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:22:12,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {477#true} ~cond := #in~cond; {622#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:22:12,901 INFO L272 TraceCheckUtils]: 25: Hoare triple {477#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {477#true} is VALID [2022-04-27 13:22:12,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {477#true} assume !false; {477#true} is VALID [2022-04-27 13:22:12,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {477#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {477#true} is VALID [2022-04-27 13:22:12,901 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {477#true} {477#true} #59#return; {477#true} is VALID [2022-04-27 13:22:12,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L272 TraceCheckUtils]: 18: Hoare triple {477#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {477#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {477#true} {477#true} #57#return; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L272 TraceCheckUtils]: 12: Hoare triple {477#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {477#true} {477#true} #55#return; {477#true} is VALID [2022-04-27 13:22:12,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:22:12,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-04-27 13:22:12,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-04-27 13:22:12,903 INFO L272 TraceCheckUtils]: 6: Hoare triple {477#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 5 then 1 else 0)); {477#true} is VALID [2022-04-27 13:22:12,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {477#true} is VALID [2022-04-27 13:22:12,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret7 := main(); {477#true} is VALID [2022-04-27 13:22:12,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #65#return; {477#true} is VALID [2022-04-27 13:22:12,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 13:22:12,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#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); {477#true} is VALID [2022-04-27 13:22:12,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-27 13:22:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:22:12,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:22:12,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988359799] [2022-04-27 13:22:12,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:22:12,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299974282] [2022-04-27 13:22:12,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299974282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:22:12,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:22:12,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-27 13:22:12,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721760943] [2022-04-27 13:22:12,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:22:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-04-27 13:22:12,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:22:12,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:22:13,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:13,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:22:13,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:22:13,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:22:13,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:22:13,031 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:22:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:14,274 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 13:22:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:22:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-04-27 13:22:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:22:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:22:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-27 13:22:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:22:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-27 13:22:14,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-27 13:22:15,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:22:15,875 INFO L225 Difference]: With dead ends: 37 [2022-04-27 13:22:15,876 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:22:15,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:22:15,877 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:22:15,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 155 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:22:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:22:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:22:15,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:22:15,878 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:22:15,878 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:22:15,878 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:22:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,878 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:22:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:22:15,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:15,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:15,878 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:22:15,878 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:22:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:22:15,878 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:22:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:22:15,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:15,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:22:15,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:22:15,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:22:15,879 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:22:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:22:15,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-04-27 13:22:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:22:15,879 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:22:15,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:22:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:22:15,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:22:15,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:22:15,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 13:22:16,081 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:22:16,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:22:16,261 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 21 48) no Hoare annotation was computed. [2022-04-27 13:22:16,262 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-27 13:22:16,263 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 13:22:16,263 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 21 48) no Hoare annotation was computed. [2022-04-27 13:22:16,263 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 45) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-27 13:22:16,263 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 45) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-27 13:22:16,263 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true [2022-04-27 13:22:16,263 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-27 13:22:16,263 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 36 45) no Hoare annotation was computed. [2022-04-27 13:22:16,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:22:16,263 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:22:16,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:22:16,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:22:16,263 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:22:16,263 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:22:16,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:22:16,264 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 13:22:16,264 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 13:22:16,264 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 13:22:16,264 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:22:16,264 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:22:16,264 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 13:22:16,266 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 13:22:16,282 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:22:16,284 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:22:16,284 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:22:16,285 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:22:16,286 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 13:22:16,287 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:22:16,287 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:22:16,287 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 13:22:16,287 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:22:16,287 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:22:16,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:22:16 BoogieIcfgContainer [2022-04-27 13:22:16,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:22:16,296 INFO L158 Benchmark]: Toolchain (without parser) took 18491.64ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 124.9MB in the beginning and 76.6MB in the end (delta: 48.3MB). Peak memory consumption was 84.9MB. Max. memory is 8.0GB. [2022-04-27 13:22:16,296 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 175.1MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:22:16,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.28ms. Allocated memory is still 175.1MB. Free memory was 124.8MB in the beginning and 150.8MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:22:16,296 INFO L158 Benchmark]: Boogie Preprocessor took 17.32ms. Allocated memory is still 175.1MB. Free memory was 150.8MB in the beginning and 149.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:22:16,297 INFO L158 Benchmark]: RCFGBuilder took 249.21ms. Allocated memory is still 175.1MB. Free memory was 149.2MB in the beginning and 137.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:22:16,297 INFO L158 Benchmark]: TraceAbstraction took 18039.35ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 137.1MB in the beginning and 76.6MB in the end (delta: 60.6MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. [2022-04-27 13:22:16,299 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 175.1MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.28ms. Allocated memory is still 175.1MB. Free memory was 124.8MB in the beginning and 150.8MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.32ms. Allocated memory is still 175.1MB. Free memory was 150.8MB in the beginning and 149.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.21ms. Allocated memory is still 175.1MB. Free memory was 149.2MB in the beginning and 137.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18039.35ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 137.1MB in the beginning and 76.6MB in the end (delta: 60.6MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 80 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 15, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 23 PreInvPairs, 34 NumberOfFragments, 48 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 87 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 3 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 52/56 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: 36]: Loop Invariant Derived loop invariant: y * az + x == z * x + a RESULT: Ultimate proved your program to be correct! [2022-04-27 13:22:16,317 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...