/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound50.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 01:08:46,184 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 01:08:46,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 01:08:46,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 01:08:46,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 01:08:46,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 01:08:46,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 01:08:46,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 01:08:46,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 01:08:46,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 01:08:46,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 01:08:46,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 01:08:46,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 01:08:46,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 01:08:46,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 01:08:46,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 01:08:46,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 01:08:46,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 01:08:46,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 01:08:46,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 01:08:46,249 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 01:08:46,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 01:08:46,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 01:08:46,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 01:08:46,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 01:08:46,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 01:08:46,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 01:08:46,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 01:08:46,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 01:08:46,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 01:08:46,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 01:08:46,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 01:08:46,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 01:08:46,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 01:08:46,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 01:08:46,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 01:08:46,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 01:08:46,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 01:08:46,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 01:08:46,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 01:08:46,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 01:08:46,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 01:08:46,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf
[2022-04-08 01:08:46,286 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 01:08:46,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 01:08:46,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-04-08 01:08:46,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-04-08 01:08:46,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-04-08 01:08:46,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-04-08 01:08:46,288 INFO L138 SettingsManager]: * Use SBE=true
[2022-04-08 01:08:46,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 01:08:46,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 01:08:46,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 01:08:46,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 01:08:46,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 01:08:46,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 01:08:46,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 01:08:46,289 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 01:08:46,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 01:08:46,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 01:08:46,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-04-08 01:08:46,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 01:08:46,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2022-04-08 01:08:46,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-04-08 01:08:46,292 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-08 01:08:46,292 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 01:08:46,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 01:08:46,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 01:08:46,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 01:08:46,523 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 01:08:46,523 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 01:08:46,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound50.c
[2022-04-08 01:08:46,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116bac92d/49c98a1e7728402fa33028a0432d9159/FLAG36b33e948
[2022-04-08 01:08:47,158 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 01:08:47,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound50.c
[2022-04-08 01:08:47,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116bac92d/49c98a1e7728402fa33028a0432d9159/FLAG36b33e948
[2022-04-08 01:08:47,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116bac92d/49c98a1e7728402fa33028a0432d9159
[2022-04-08 01:08:47,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 01:08:47,556 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-08 01:08:47,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 01:08:47,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 01:08:47,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 01:08:47,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274579aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47, skipping insertion in model container
[2022-04-08 01:08:47,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 01:08:47,580 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 01:08:47,697 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_valuebound50.c[525,538]
[2022-04-08 01:08:47,719 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 01:08:47,727 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 01:08:47,734 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_valuebound50.c[525,538]
[2022-04-08 01:08:47,739 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 01:08:47,747 INFO L208 MainTranslator]: Completed translation
[2022-04-08 01:08:47,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47 WrapperNode
[2022-04-08 01:08:47,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 01:08:47,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 01:08:47,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 01:08:47,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 01:08:47,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 01:08:47,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 01:08:47,767 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 01:08:47,767 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 01:08:47,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (1/1) ...
[2022-04-08 01:08:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 01:08:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 01:08:47,800 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-08 01:08:47,812 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-08 01:08:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 01:08:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 01:08:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 01:08:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 01:08:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 01:08:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 01:08:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 01:08:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 01:08:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 01:08:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 01:08:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 01:08:47,873 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 01:08:47,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 01:08:48,066 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 01:08:48,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 01:08:48,084 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 01:08:48,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:08:48 BoogieIcfgContainer
[2022-04-08 01:08:48,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 01:08:48,085 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-08 01:08:48,085 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-08 01:08:48,086 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-08 01:08:48,089 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:08:48" (1/1) ...
[2022-04-08 01:08:48,090 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR
[2022-04-08 01:08:48,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:08:48 BasicIcfg
[2022-04-08 01:08:48,137 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-08 01:08:48,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 01:08:48,138 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 01:08:48,140 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 01:08:48,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:08:47" (1/4) ...
[2022-04-08 01:08:48,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565b7a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:08:48, skipping insertion in model container
[2022-04-08 01:08:48,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:08:47" (2/4) ...
[2022-04-08 01:08:48,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565b7a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:08:48, skipping insertion in model container
[2022-04-08 01:08:48,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:08:48" (3/4) ...
[2022-04-08 01:08:48,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565b7a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:08:48, skipping insertion in model container
[2022-04-08 01:08:48,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:08:48" (4/4) ...
[2022-04-08 01:08:48,142 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound50.cqvasr
[2022-04-08 01:08:48,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-04-08 01:08:48,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 01:08:48,193 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 01:08:48,199 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 01:08:48,200 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 01:08:48,222 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-08 01:08:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 01:08:48,226 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 01:08:48,226 INFO L499 BasicCegarLoop]: 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-08 01:08:48,227 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 01:08:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 01:08:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1338008438, now seen corresponding path program 1 times
[2022-04-08 01:08:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 01:08:48,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488821886]
[2022-04-08 01:08:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:08:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 01:08:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 01:08:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:48,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID
[2022-04-08 01:08:48,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID
[2022-04-08 01:08:48,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID
[2022-04-08 01:08:48,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 01:08:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:48,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID
[2022-04-08 01:08:48,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#false} is VALID
[2022-04-08 01:08:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-08 01:08:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:48,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID
[2022-04-08 01:08:48,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID
[2022-04-08 01:08:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2022-04-08 01:08:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:48,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID
[2022-04-08 01:08:48,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#false} is VALID
[2022-04-08 01:08:48,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 01:08:48,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID
[2022-04-08 01:08:48,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID
[2022-04-08 01:08:48,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID
[2022-04-08 01:08:48,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID
[2022-04-08 01:08:48,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {34#true} is VALID
[2022-04-08 01:08:48,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#true} is VALID
[2022-04-08 01:08:48,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID
[2022-04-08 01:08:48,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,475 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#false} is VALID
[2022-04-08 01:08:48,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {35#false} is VALID
[2022-04-08 01:08:48,475 INFO L272 TraceCheckUtils]: 12: Hoare triple {35#false} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {34#true} is VALID
[2022-04-08 01:08:48,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID
[2022-04-08 01:08:48,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,476 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35#false} {35#false} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID
[2022-04-08 01:08:48,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {35#false} is VALID
[2022-04-08 01:08:48,477 INFO L272 TraceCheckUtils]: 18: Hoare triple {35#false} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#true} is VALID
[2022-04-08 01:08:48,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID
[2022-04-08 01:08:48,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,478 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35#false} {35#false} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#false} is VALID
[2022-04-08 01:08:48,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#false} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {35#false} is VALID
[2022-04-08 01:08:48,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} [84] L36-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,479 INFO L272 TraceCheckUtils]: 25: Hoare triple {35#false} [87] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~z~0_11 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6)) v_main_~a~0_10) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {35#false} is VALID
[2022-04-08 01:08:48,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID
[2022-04-08 01:08:48,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {35#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID
[2022-04-08 01:08:48,480 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-08 01:08:48,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 01:08:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488821886]
[2022-04-08 01:08:48,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488821886] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 01:08:48,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 01:08:48,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 01:08:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635662530]
[2022-04-08 01:08:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 01:08:48,486 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-08 01:08:48,487 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 01:08:48,491 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-08 01:08:48,535 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-08 01:08:48,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 01:08:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 01:08:48,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 01:08:48,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 01:08:48,556 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-08 01:08:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:08:48,695 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions.
[2022-04-08 01:08:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 01:08:48,697 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-08 01:08:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 01:08:48,702 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-08 01:08:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2022-04-08 01:08:48,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-08 01:08:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2022-04-08 01:08:48,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions.
[2022-04-08 01:08:48,775 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-08 01:08:48,780 INFO L225 Difference]: With dead ends: 55
[2022-04-08 01:08:48,781 INFO L226 Difference]: Without dead ends: 26
[2022-04-08 01:08:48,783 INFO L912 BasicCegarLoop]: 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-08 01:08:48,785 INFO L913 BasicCegarLoop]: 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-08 01:08:48,786 INFO L914 BasicCegarLoop]: 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-08 01:08:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-08 01:08:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2022-04-08 01:08:48,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 01:08:48,816 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-08 01:08:48,816 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-08 01:08:48,817 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-08 01:08:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:08:48,822 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-08 01:08:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 01:08:48,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:08:48,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:08:48,823 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-08 01:08:48,824 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-08 01:08:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:08:48,830 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-08 01:08:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 01:08:48,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:08:48,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:08:48,830 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 01:08:48,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 01:08:48,831 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-08 01:08:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions.
[2022-04-08 01:08:48,836 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29
[2022-04-08 01:08:48,836 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 01:08:48,836 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions.
[2022-04-08 01:08:48,837 INFO L479 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-08 01:08:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 01:08:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 01:08:48,839 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 01:08:48,839 INFO L499 BasicCegarLoop]: 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-08 01:08:48,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 01:08:48,840 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 01:08:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 01:08:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1251333530, now seen corresponding path program 1 times
[2022-04-08 01:08:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 01:08:48,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721341564]
[2022-04-08 01:08:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:08:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 01:08:48,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 01:08:48,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165199364]
[2022-04-08 01:08:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:08:48,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 01:08:48,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 01:08:48,885 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-08 01:08:48,925 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-08 01:08:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:48,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-04-08 01:08:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:49,007 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 01:08:49,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {218#true} is VALID
[2022-04-08 01:08:49,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {218#true} is VALID
[2022-04-08 01:08:49,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {218#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {218#true} is VALID
[2022-04-08 01:08:49,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID
[2022-04-08 01:08:49,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {218#true} {218#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {218#true} is VALID
[2022-04-08 01:08:49,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {218#true} is VALID
[2022-04-08 01:08:49,237 INFO L272 TraceCheckUtils]: 12: Hoare triple {218#true} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {218#true} is VALID
[2022-04-08 01:08:49,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID
[2022-04-08 01:08:49,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,239 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {218#true} {218#true} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {218#true} is VALID
[2022-04-08 01:08:49,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {218#true} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {218#true} is VALID
[2022-04-08 01:08:49,240 INFO L272 TraceCheckUtils]: 18: Hoare triple {218#true} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {218#true} is VALID
[2022-04-08 01:08:49,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID
[2022-04-08 01:08:49,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID
[2022-04-08 01:08:49,241 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {218#true} {218#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {218#true} is VALID
[2022-04-08 01:08:49,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {218#true} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~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-08 01:08:49,242 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))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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-08 01:08:49,243 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))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 01:08:49,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {303#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:08:49,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {219#false} is VALID
[2022-04-08 01:08:49,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {219#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID
[2022-04-08 01:08:49,244 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-08 01:08:49,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 01:08:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 01:08:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721341564]
[2022-04-08 01:08:49,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 01:08:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165199364]
[2022-04-08 01:08:49,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165199364] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 01:08:49,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 01:08:49,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 01:08:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819286788]
[2022-04-08 01:08:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 01:08:49,251 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-08 01:08:49,252 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 01:08:49,253 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-08 01:08:49,274 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-08 01:08:49,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 01:08:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 01:08:49,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 01:08:49,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 01:08:49,275 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-08 01:08:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:08:49,370 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions.
[2022-04-08 01:08:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 01:08:49,371 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-08 01:08:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 01:08:49,371 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-08 01:08:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions.
[2022-04-08 01:08:49,373 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-08 01:08:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions.
[2022-04-08 01:08:49,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions.
[2022-04-08 01:08:49,403 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-08 01:08:49,405 INFO L225 Difference]: With dead ends: 36
[2022-04-08 01:08:49,405 INFO L226 Difference]: Without dead ends: 33
[2022-04-08 01:08:49,405 INFO L912 BasicCegarLoop]: 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-08 01:08:49,406 INFO L913 BasicCegarLoop]: 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-08 01:08:49,406 INFO L914 BasicCegarLoop]: 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-08 01:08:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2022-04-08 01:08:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2022-04-08 01:08:49,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 01:08:49,411 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-08 01:08:49,411 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-08 01:08:49,411 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-08 01:08:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:08:49,413 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions.
[2022-04-08 01:08:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions.
[2022-04-08 01:08:49,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:08:49,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:08:49,414 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-08 01:08:49,414 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-08 01:08:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:08:49,416 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions.
[2022-04-08 01:08:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions.
[2022-04-08 01:08:49,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:08:49,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:08:49,416 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 01:08:49,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 01:08:49,416 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-08 01:08:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions.
[2022-04-08 01:08:49,418 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29
[2022-04-08 01:08:49,418 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 01:08:49,418 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions.
[2022-04-08 01:08:49,418 INFO L479 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-08 01:08:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions.
[2022-04-08 01:08:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-08 01:08:49,419 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 01:08:49,419 INFO L499 BasicCegarLoop]: 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-08 01:08:49,438 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-08 01:08:49,639 WARN L460 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-08 01:08:49,639 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 01:08:49,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 01:08:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash -284720885, now seen corresponding path program 1 times
[2022-04-08 01:08:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 01:08:49,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25956903]
[2022-04-08 01:08:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:08:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 01:08:49,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 01:08:49,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82409886]
[2022-04-08 01:08:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:08:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 01:08:49,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 01:08:49,663 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-08 01:08:49,664 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-08 01:08:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:49,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core
[2022-04-08 01:08:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:08:49,721 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 01:08:49,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {477#true} is VALID
[2022-04-08 01:08:49,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:49,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {477#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:49,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {477#true} is VALID
[2022-04-08 01:08:49,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {477#true} {477#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:49,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#true} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:49,962 INFO L272 TraceCheckUtils]: 12: Hoare triple {477#true} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:49,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {477#true} is VALID
[2022-04-08 01:08:49,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {477#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,963 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {477#true} {477#true} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:49,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {477#true} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {477#true} is VALID
[2022-04-08 01:08:49,963 INFO L272 TraceCheckUtils]: 18: Hoare triple {477#true} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:49,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {477#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {477#true} is VALID
[2022-04-08 01:08:49,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {477#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {477#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:49,964 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {477#true} {477#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:49,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {477#true} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~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-08 01:08:49,965 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))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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-08 01:08:49,965 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))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:49,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {477#true} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:08:49,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [95] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:08:49,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:08:49,967 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))} [104] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~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-08 01:08:49,968 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))} [92] L37-1-->L36-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_8)) (< v_main_~c~0_5 v_main_~k~0_5) (= (+ v_main_~a~0_7 (* v_main_~x~0_7 v_main_~z~0_8)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_7} OutVars{main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~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-08 01:08:49,968 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))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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-08 01:08:49,971 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))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 01:08:49,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {582#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {586#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:08:49,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {586#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {478#false} is VALID
[2022-04-08 01:08:49,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {478#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#false} is VALID
[2022-04-08 01:08:49,972 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-08 01:08:49,973 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 01:08:57,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {478#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#false} is VALID
[2022-04-08 01:08:57,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {586#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {478#false} is VALID
[2022-04-08 01:08:57,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {582#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {586#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:08:57,186 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))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 01:08:57,187 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))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID
[2022-04-08 01:08:57,216 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))))} [92] L37-1-->L36-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_8)) (< v_main_~c~0_5 v_main_~k~0_5) (= (+ v_main_~a~0_7 (* v_main_~x~0_7 v_main_~z~0_8)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_7} OutVars{main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {602#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID
[2022-04-08 01:08:57,220 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} {477#true} [104] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {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-08 01:08:57,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:08:57,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {622#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [95] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:08:57,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {477#true} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {622#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 01:08:57,228 INFO L272 TraceCheckUtils]: 25: Hoare triple {477#true} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:57,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {477#true} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {477#true} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {477#true} is VALID
[2022-04-08 01:08:57,228 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {477#true} {477#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:57,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {477#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {477#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {477#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {477#true} is VALID
[2022-04-08 01:08:57,229 INFO L272 TraceCheckUtils]: 18: Hoare triple {477#true} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= v_main_~k~0_6 50) (<= 0 v_main_~k~0_6)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:57,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {477#true} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {477#true} is VALID
[2022-04-08 01:08:57,229 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {477#true} {477#true} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:57,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {477#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {477#true} is VALID
[2022-04-08 01:08:57,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {477#true} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 50)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:57,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#true} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:57,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {477#true} {477#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:57,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {477#true} is VALID
[2022-04-08 01:08:57,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {477#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 50)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {477#true} is VALID
[2022-04-08 01:08:57,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {477#true} is VALID
[2022-04-08 01:08:57,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {477#true} is VALID
[2022-04-08 01:08:57,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID
[2022-04-08 01:08:57,232 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-08 01:08:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 01:08:57,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25956903]
[2022-04-08 01:08:57,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 01:08:57,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82409886]
[2022-04-08 01:08:57,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82409886] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 01:08:57,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 01:08:57,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11
[2022-04-08 01:08:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72959272]
[2022-04-08 01:08:57,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-08 01:08:57,233 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-08 01:08:57,234 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 01:08:57,234 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-08 01:08:57,444 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-08 01:08:57,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 01:08:57,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 01:08:57,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 01:08:57,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2022-04-08 01:08:57,445 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-08 01:08:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:08:59,671 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions.
[2022-04-08 01:08:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 01:08:59,671 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-08 01:08:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 01:08:59,672 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-08 01:08:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions.
[2022-04-08 01:08:59,673 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-08 01:08:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions.
[2022-04-08 01:08:59,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions.
[2022-04-08 01:09:01,898 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-08 01:09:01,898 INFO L225 Difference]: With dead ends: 37
[2022-04-08 01:09:01,898 INFO L226 Difference]: Without dead ends: 0
[2022-04-08 01:09:01,899 INFO L912 BasicCegarLoop]: 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-08 01:09:01,900 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time
[2022-04-08 01:09:01,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 155 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2022-04-08 01:09:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-08 01:09:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-08 01:09:01,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 01:09:01,901 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-08 01:09:01,901 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-08 01:09:01,901 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-08 01:09:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:09:01,901 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 01:09:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 01:09:01,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:09:01,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:09:01,902 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-08 01:09:01,902 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-08 01:09:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:09:01,902 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 01:09:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 01:09:01,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:09:01,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:09:01,902 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 01:09:01,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 01:09:01,902 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-08 01:09:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-08 01:09:01,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36
[2022-04-08 01:09:01,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 01:09:01,903 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-08 01:09:01,903 INFO L479 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-08 01:09:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 01:09:01,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:09:01,913 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 01:09:01,975 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-08 01:09:02,124 WARN L460 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-08 01:09:02,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-08 01:09:02,380 INFO L878 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-08 01:09:02,380 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed.
[2022-04-08 01:09:02,380 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-08 01:09:02,381 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true
[2022-04-08 01:09:02,381 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true
[2022-04-08 01:09:02,381 INFO L882 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed.
[2022-04-08 01:09:02,381 INFO L878 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-08 01:09:02,382 INFO L878 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-08 01:09:02,382 INFO L878 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-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 36 45) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 48) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 48) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed.
[2022-04-08 01:09:02,382 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed.
[2022-04-08 01:09:02,384 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2022-04-08 01:09:02,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-08 01:09:02,395 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation
[2022-04-08 01:09:02,396 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation
[2022-04-08 01:09:02,397 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-08 01:09:02,397 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-08 01:09:02,397 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-08 01:09:02,397 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-08 01:09:02,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:09:02 BasicIcfg
[2022-04-08 01:09:02,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 01:09:02,407 INFO L158 Benchmark]: Toolchain (without parser) took 14850.67ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 113.8MB in the beginning and 117.7MB in the end (delta: -3.9MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB.
[2022-04-08 01:09:02,407 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 01:09:02,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.54ms. Allocated memory is still 164.6MB. Free memory was 113.6MB in the beginning and 142.6MB in the end (delta: -29.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 01:09:02,409 INFO L158 Benchmark]: Boogie Preprocessor took 18.60ms. Allocated memory is still 164.6MB. Free memory was 142.6MB in the beginning and 141.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-08 01:09:02,409 INFO L158 Benchmark]: RCFGBuilder took 317.71ms. Allocated memory is still 164.6MB. Free memory was 141.1MB in the beginning and 129.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 01:09:02,409 INFO L158 Benchmark]: IcfgTransformer took 51.33ms. Allocated memory is still 164.6MB. Free memory was 129.6MB in the beginning and 127.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 01:09:02,409 INFO L158 Benchmark]: TraceAbstraction took 14268.41ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 127.5MB in the beginning and 117.7MB in the end (delta: 9.8MB). Peak memory consumption was 44.2MB. Max. memory is 8.0GB.
[2022-04-08 01:09:02,413 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.10ms. Allocated memory is still 164.6MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 189.54ms. Allocated memory is still 164.6MB. Free memory was 113.6MB in the beginning and 142.6MB in the end (delta: -29.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 18.60ms. Allocated memory is still 164.6MB. Free memory was 142.6MB in the beginning and 141.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 317.71ms. Allocated memory is still 164.6MB. Free memory was 141.1MB in the beginning and 129.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* IcfgTransformer took 51.33ms. Allocated memory is still 164.6MB. Free memory was 129.6MB in the beginning and 127.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* TraceAbstraction took 14268.41ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 127.5MB in the beginning and 117.7MB in the end (delta: 9.8MB). Peak memory consumption was 44.2MB. 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 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 1.1s 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, 7.9s 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-08 01:09:02,447 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...