/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/geo1-ll_valuebound20.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 01:07:41,175 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 01:07:41,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 01:07:41,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 01:07:41,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 01:07:41,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 01:07:41,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 01:07:41,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 01:07:41,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 01:07:41,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 01:07:41,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 01:07:41,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 01:07:41,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 01:07:41,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 01:07:41,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 01:07:41,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 01:07:41,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 01:07:41,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 01:07:41,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 01:07:41,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 01:07:41,224 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 01:07:41,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 01:07:41,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 01:07:41,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 01:07:41,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 01:07:41,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 01:07:41,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 01:07:41,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 01:07:41,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 01:07:41,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 01:07:41,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 01:07:41,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 01:07:41,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 01:07:41,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 01:07:41,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 01:07:41,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 01:07:41,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 01:07:41,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 01:07:41,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 01:07:41,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 01:07:41,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 01:07:41,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 01:07:41,249 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:07:41,268 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 01:07:41,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 01:07:41,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-04-08 01:07:41,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-04-08 01:07:41,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-04-08 01:07:41,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-04-08 01:07:41,270 INFO L138 SettingsManager]: * Use SBE=true
[2022-04-08 01:07:41,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 01:07:41,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 01:07:41,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 01:07:41,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 01:07:41,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 01:07:41,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 01:07:41,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 01:07:41,271 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 01:07:41,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 01:07:41,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 01:07:41,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 01:07:41,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 01:07:41,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 01:07:41,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 01:07:41,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-04-08 01:07:41,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-04-08 01:07:41,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-08 01:07:41,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-04-08 01:07:41,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 01:07:41,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2022-04-08 01:07:41,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2022-04-08 01:07:41,274 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-08 01:07:41,274 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:07:41,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 01:07:41,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 01:07:41,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 01:07:41,514 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 01:07:41,515 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 01:07:41,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c
[2022-04-08 01:07:41,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3b21ea2/54e7d602506747a0bf2a8c00b68b7f89/FLAGf227ba99f
[2022-04-08 01:07:41,970 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 01:07:41,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c
[2022-04-08 01:07:41,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3b21ea2/54e7d602506747a0bf2a8c00b68b7f89/FLAGf227ba99f
[2022-04-08 01:07:41,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3b21ea2/54e7d602506747a0bf2a8c00b68b7f89
[2022-04-08 01:07:41,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 01:07:41,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-08 01:07:41,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 01:07:41,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 01:07:41,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 01:07:41,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:07:41" (1/1) ...
[2022-04-08 01:07:41,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d9caca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:41, skipping insertion in model container
[2022-04-08 01:07:41,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:07:41" (1/1) ...
[2022-04-08 01:07:42,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 01:07:42,013 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 01:07:42,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c[546,559]
[2022-04-08 01:07:42,176 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 01:07:42,183 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 01:07:42,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound20.c[546,559]
[2022-04-08 01:07:42,199 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 01:07:42,210 INFO L208 MainTranslator]: Completed translation
[2022-04-08 01:07:42,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42 WrapperNode
[2022-04-08 01:07:42,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 01:07:42,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 01:07:42,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 01:07:42,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 01:07:42,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 01:07:42,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 01:07:42,240 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 01:07:42,240 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 01:07:42,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 01:07:42,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 01:07:42,280 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:07:42,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 01:07:42,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 01:07:42,322 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 01:07:42,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 01:07:42,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 01:07:42,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 01:07:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 01:07:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 01:07:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 01:07:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 01:07:42,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 01:07:42,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 01:07:42,311 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:07:42,377 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 01:07:42,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 01:07:42,499 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 01:07:42,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 01:07:42,506 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 01:07:42,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:07:42 BoogieIcfgContainer
[2022-04-08 01:07:42,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 01:07:42,508 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-08 01:07:42,508 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-08 01:07:42,509 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-08 01:07:42,511 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:07:42" (1/1) ...
[2022-04-08 01:07:42,513 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR
[2022-04-08 01:07:42,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:07:42 BasicIcfg
[2022-04-08 01:07:42,537 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-08 01:07:42,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 01:07:42,539 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 01:07:42,541 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 01:07:42,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:07:41" (1/4) ...
[2022-04-08 01:07:42,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fb555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:07:42, skipping insertion in model container
[2022-04-08 01:07:42,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:42" (2/4) ...
[2022-04-08 01:07:42,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fb555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:07:42, skipping insertion in model container
[2022-04-08 01:07:42,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:07:42" (3/4) ...
[2022-04-08 01:07:42,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fb555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:07:42, skipping insertion in model container
[2022-04-08 01:07:42,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:07:42" (4/4) ...
[2022-04-08 01:07:42,544 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound20.cqvasr
[2022-04-08 01:07:42,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-04-08 01:07:42,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 01:07:42,593 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 01:07:42,608 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:07:42,608 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 01:07:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 01:07:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 01:07:42,631 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 01:07:42,632 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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:07:42,632 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 01:07:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 01:07:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1950279688, now seen corresponding path program 1 times
[2022-04-08 01:07:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 01:07:42,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208322635]
[2022-04-08 01:07:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:07:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 01:07:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 01:07:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:42,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] 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] {35#true} is VALID
[2022-04-08 01:07:42,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID
[2022-04-08 01:07:42,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID
[2022-04-08 01:07:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 01:07:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:42,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} [104] assume_abort_if_notEXIT-->L26-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_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {36#false} is VALID
[2022-04-08 01:07:42,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-08 01:07:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:42,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-08 01:07:42,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2022-04-08 01:07:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:42,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-08 01:07:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2022-04-08 01:07:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:42,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-08 01:07:42,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 01:07:42,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] 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] {35#true} is VALID
[2022-04-08 01:07:42,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID
[2022-04-08 01:07:42,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID
[2022-04-08 01:07:42,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID
[2022-04-08 01:07:42,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} [75] mainENTRY-->L26: 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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {35#true} is VALID
[2022-04-08 01:07:42,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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#true} is VALID
[2022-04-08 01:07:42,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} [104] assume_abort_if_notEXIT-->L26-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_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {36#false} is VALID
[2022-04-08 01:07:42,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {36#false} is VALID
[2022-04-08 01:07:42,926 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#true} is VALID
[2022-04-08 01:07:42,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,928 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-08 01:07:42,928 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#true} is VALID
[2022-04-08 01:07:42,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,930 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-08 01:07:42,931 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#true} is VALID
[2022-04-08 01:07:42,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} [79] assume_abort_if_notENTRY-->L13: 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] {35#true} is VALID
[2022-04-08 01:07:42,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} [81] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,932 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {36#false} is VALID
[2022-04-08 01:07:42,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {36#false} is VALID
[2022-04-08 01:07:42,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,934 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {36#false} is VALID
[2022-04-08 01:07:42,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} [95] __VERIFIER_assertENTRY-->L16: 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] {36#false} is VALID
[2022-04-08 01:07:42,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} [97] L16-->L17: 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[] {36#false} is VALID
[2022-04-08 01:07:42,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID
[2022-04-08 01:07:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-08 01:07:42,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 01:07:42,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208322635]
[2022-04-08 01:07:42,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208322635] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 01:07:42,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 01:07:42,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 01:07:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341973200]
[2022-04-08 01:07:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 01:07:42,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33
[2022-04-08 01:07:42,947 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 01:07:42,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-08 01:07:42,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 01:07:42,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 01:07:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 01:07:43,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 01:07:43,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 01:07:43,023 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-08 01:07:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:43,176 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions.
[2022-04-08 01:07:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 01:07:43,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33
[2022-04-08 01:07:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 01:07:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-08 01:07:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions.
[2022-04-08 01:07:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-08 01:07:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions.
[2022-04-08 01:07:43,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions.
[2022-04-08 01:07:43,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 01:07:43,291 INFO L225 Difference]: With dead ends: 57
[2022-04-08 01:07:43,292 INFO L226 Difference]: Without dead ends: 27
[2022-04-08 01:07:43,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:07:43,300 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 01:07:43,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 01:07:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-08 01:07:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-08 01:07:43,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 01:07:43,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 01:07:43,341 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 01:07:43,342 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 01:07:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:43,349 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-08 01:07:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-08 01:07:43,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:07:43,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:07:43,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states.
[2022-04-08 01:07:43,353 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states.
[2022-04-08 01:07:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:43,359 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-08 01:07:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-08 01:07:43,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:07:43,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:07:43,360 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 01:07:43,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 01:07:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 01:07:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions.
[2022-04-08 01:07:43,362 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33
[2022-04-08 01:07:43,362 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 01:07:43,363 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions.
[2022-04-08 01:07:43,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-08 01:07:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-08 01:07:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-08 01:07:43,364 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 01:07:43,365 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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:07:43,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 01:07:43,365 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 01:07:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 01:07:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1010552682, now seen corresponding path program 1 times
[2022-04-08 01:07:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 01:07:43,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953280710]
[2022-04-08 01:07:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:07:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 01:07:43,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 01:07:43,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140969904]
[2022-04-08 01:07:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:07:43,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 01:07:43,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 01:07:43,415 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:07:43,447 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:07:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:43,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 01:07:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:43,510 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 01:07:43,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [73] 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] {231#true} is VALID
[2022-04-08 01:07:43,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [75] mainENTRY-->L26: 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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {231#true} is VALID
[2022-04-08 01:07:43,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {231#true} is VALID
[2022-04-08 01:07:43,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} [79] assume_abort_if_notENTRY-->L13: 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] {231#true} is VALID
[2022-04-08 01:07:43,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} [82] L13-->L13-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[] {231#true} is VALID
[2022-04-08 01:07:43,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {231#true} {231#true} [104] assume_abort_if_notEXIT-->L26-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_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {231#true} is VALID
[2022-04-08 01:07:43,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {231#true} is VALID
[2022-04-08 01:07:43,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {231#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {231#true} is VALID
[2022-04-08 01:07:43,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} [79] assume_abort_if_notENTRY-->L13: 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] {231#true} is VALID
[2022-04-08 01:07:43,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#true} [82] L13-->L13-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[] {231#true} is VALID
[2022-04-08 01:07:43,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,719 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#true} {231#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {231#true} is VALID
[2022-04-08 01:07:43,720 INFO L272 TraceCheckUtils]: 17: Hoare triple {231#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {231#true} is VALID
[2022-04-08 01:07:43,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} [79] assume_abort_if_notENTRY-->L13: 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] {231#true} is VALID
[2022-04-08 01:07:43,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#true} [82] L13-->L13-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[] {231#true} is VALID
[2022-04-08 01:07:43,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {231#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,721 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {231#true} {231#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {231#true} is VALID
[2022-04-08 01:07:43,721 INFO L272 TraceCheckUtils]: 22: Hoare triple {231#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {231#true} is VALID
[2022-04-08 01:07:43,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} [79] assume_abort_if_notENTRY-->L13: 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] {231#true} is VALID
[2022-04-08 01:07:43,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#true} [82] L13-->L13-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[] {231#true} is VALID
[2022-04-08 01:07:43,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID
[2022-04-08 01:07:43,722 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {231#true} {231#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {231#true} is VALID
[2022-04-08 01:07:43,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {231#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID
[2022-04-08 01:07:43,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID
[2022-04-08 01:07:43,724 INFO L272 TraceCheckUtils]: 29: Hoare triple {317#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {324#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 01:07:43,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {324#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: 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] {328#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:07:43,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {328#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: 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[] {232#false} is VALID
[2022-04-08 01:07:43,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID
[2022-04-08 01:07:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-08 01:07:43,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 01:07:43,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 01:07:43,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953280710]
[2022-04-08 01:07:43,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 01:07:43,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140969904]
[2022-04-08 01:07:43,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140969904] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 01:07:43,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 01:07:43,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 01:07:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974659379]
[2022-04-08 01:07:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 01:07:43,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33
[2022-04-08 01:07:43,729 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 01:07:43,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-08 01:07:43,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 01:07:43,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 01:07:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 01:07:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 01:07:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 01:07:43,751 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-08 01:07:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:43,864 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions.
[2022-04-08 01:07:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 01:07:43,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33
[2022-04-08 01:07:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 01:07:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-08 01:07:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions.
[2022-04-08 01:07:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-08 01:07:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions.
[2022-04-08 01:07:43,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions.
[2022-04-08 01:07:43,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 01:07:43,916 INFO L225 Difference]: With dead ends: 37
[2022-04-08 01:07:43,916 INFO L226 Difference]: Without dead ends: 35
[2022-04-08 01:07:43,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:07:43,919 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 01:07:43,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 01:07:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2022-04-08 01:07:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33.
[2022-04-08 01:07:43,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 01:07:43,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 01:07:43,932 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 01:07:43,933 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 01:07:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:43,936 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions.
[2022-04-08 01:07:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions.
[2022-04-08 01:07:43,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:07:43,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:07:43,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states.
[2022-04-08 01:07:43,940 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states.
[2022-04-08 01:07:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:43,942 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions.
[2022-04-08 01:07:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions.
[2022-04-08 01:07:43,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:07:43,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:07:43,943 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 01:07:43,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 01:07:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 01:07:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions.
[2022-04-08 01:07:43,946 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33
[2022-04-08 01:07:43,946 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 01:07:43,946 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions.
[2022-04-08 01:07:43,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-08 01:07:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions.
[2022-04-08 01:07:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2022-04-08 01:07:43,947 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 01:07:43,947 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 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:07:43,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-08 01:07:44,169 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:07:44,170 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 01:07:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 01:07:44,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1070211269, now seen corresponding path program 1 times
[2022-04-08 01:07:44,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 01:07:44,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450610656]
[2022-04-08 01:07:44,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:07:44,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 01:07:44,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 01:07:44,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672810545]
[2022-04-08 01:07:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 01:07:44,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 01:07:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 01:07:44,193 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:07:44,248 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:07:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:44,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-08 01:07:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 01:07:44,281 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 01:07:47,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {508#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} [73] 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] {508#true} is VALID
[2022-04-08 01:07:47,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {508#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#true} [75] mainENTRY-->L26: 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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {508#true} is VALID
[2022-04-08 01:07:47,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {508#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {508#true} is VALID
[2022-04-08 01:07:47,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:47,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:47,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {508#true} {508#true} [104] assume_abort_if_notEXIT-->L26-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_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {508#true} is VALID
[2022-04-08 01:07:47,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {508#true} is VALID
[2022-04-08 01:07:47,370 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:47,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:47,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:47,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,370 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {508#true} {508#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:47,371 INFO L272 TraceCheckUtils]: 17: Hoare triple {508#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:47,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:47,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:47,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,371 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {508#true} {508#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:47,372 INFO L272 TraceCheckUtils]: 22: Hoare triple {508#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:47,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:47,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:47,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,372 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {508#true} {508#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:47,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {508#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {508#true} is VALID
[2022-04-08 01:07:47,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {508#true} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:47,373 INFO L272 TraceCheckUtils]: 29: Hoare triple {508#true} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {508#true} is VALID
[2022-04-08 01:07:47,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {508#true} [95] __VERIFIER_assertENTRY-->L16: 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] {603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:07:47,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [98] L16-->L16-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[] {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:07:47,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} [102] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:07:47,375 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} {508#true} [109] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID
[2022-04-08 01:07:47,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [93] L37-1-->L36-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID
[2022-04-08 01:07:47,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [90] L36-3-->L50: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {621#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID
[2022-04-08 01:07:47,383 INFO L272 TraceCheckUtils]: 36: Hoare triple {621#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} [92] L50-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 01:07:47,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: 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] {629#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:07:47,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: 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[] {509#false} is VALID
[2022-04-08 01:07:47,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {509#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#false} is VALID
[2022-04-08 01:07:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-08 01:07:47,385 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 01:07:51,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {509#false} [100] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#false} is VALID
[2022-04-08 01:07:51,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} [97] L16-->L17: 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[] {509#false} is VALID
[2022-04-08 01:07:51,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L16: 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] {629#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 01:07:51,794 INFO L272 TraceCheckUtils]: 36: Hoare triple {645#(= (+ main_~x~0 1) main_~y~0)} [92] L50-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 01:07:51,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [90] L36-3-->L50: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {645#(= (+ main_~x~0 1) main_~y~0)} is VALID
[2022-04-08 01:07:51,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [93] L37-1-->L36-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID
[2022-04-08 01:07:51,796 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} {508#true} [109] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {614#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID
[2022-04-08 01:07:51,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {607#(not (= |__VERIFIER_assert_#in~cond| 0))} [102] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:07:51,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [98] L16-->L16-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[] {607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 01:07:51,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {508#true} [95] __VERIFIER_assertENTRY-->L16: 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] {664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 01:07:51,798 INFO L272 TraceCheckUtils]: 29: Hoare triple {508#true} [91] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* v_main_~z~0_12 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {508#true} is VALID
[2022-04-08 01:07:51,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {508#true} [89] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {508#true} [86] L30-->L36-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_7) (= v_main_~c~0_2 1) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_7} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {508#true} is VALID
[2022-04-08 01:07:51,799 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {508#true} {508#true} [107] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:51,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:51,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:51,800 INFO L272 TraceCheckUtils]: 22: Hoare triple {508#true} [85] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:51,800 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {508#true} {508#true} [106] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:51,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:51,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:51,803 INFO L272 TraceCheckUtils]: 17: Hoare triple {508#true} [83] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~z~0_11) 1 0)) InVars {main_~z~0=v_main_~z~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:51,803 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {508#true} {508#true} [105] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:51,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:51,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:51,806 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#true} [80] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~k~0_7) (<= v_main_~k~0_7 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {508#true} is VALID
[2022-04-08 01:07:51,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#true} [78] L26-1-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {508#true} is VALID
[2022-04-08 01:07:51,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {508#true} {508#true} [104] assume_abort_if_notEXIT-->L26-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_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {508#true} is VALID
[2022-04-08 01:07:51,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {508#true} [82] L13-->L13-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[] {508#true} is VALID
[2022-04-08 01:07:51,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {508#true} [79] assume_abort_if_notENTRY-->L13: 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] {508#true} is VALID
[2022-04-08 01:07:51,807 INFO L272 TraceCheckUtils]: 6: Hoare triple {508#true} [77] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_10) (<= v_main_~z~0_10 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_10} 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] {508#true} is VALID
[2022-04-08 01:07:51,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#true} [75] mainENTRY-->L26: 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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {508#true} is VALID
[2022-04-08 01:07:51,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {508#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {508#true} {508#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} [73] 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] {508#true} is VALID
[2022-04-08 01:07:51,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {508#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#true} is VALID
[2022-04-08 01:07:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-08 01:07:51,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 01:07:51,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450610656]
[2022-04-08 01:07:51,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 01:07:51,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672810545]
[2022-04-08 01:07:51,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672810545] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 01:07:51,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 01:07:51,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10
[2022-04-08 01:07:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745220225]
[2022-04-08 01:07:51,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-08 01:07:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40
[2022-04-08 01:07:51,816 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 01:07:51,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6)
[2022-04-08 01:07:51,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 01:07:51,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 01:07:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-08 01:07:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 01:07:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2022-04-08 01:07:51,850 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6)
[2022-04-08 01:07:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:52,083 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions.
[2022-04-08 01:07:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 01:07:52,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40
[2022-04-08 01:07:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 01:07:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6)
[2022-04-08 01:07:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions.
[2022-04-08 01:07:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6)
[2022-04-08 01:07:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions.
[2022-04-08 01:07:52,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions.
[2022-04-08 01:07:52,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 01:07:52,139 INFO L225 Difference]: With dead ends: 33
[2022-04-08 01:07:52,139 INFO L226 Difference]: Without dead ends: 0
[2022-04-08 01:07:52,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-04-08 01:07:52,140 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 01:07:52,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 01:07:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-08 01:07:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-08 01:07:52,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 01:07:52,141 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:07:52,142 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:07:52,142 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:07:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:52,142 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 01:07:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 01:07:52,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:07:52,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:07:52,142 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:07:52,142 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:07:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 01:07:52,142 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 01:07:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 01:07:52,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:07:52,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 01:07:52,143 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 01:07:52,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 01:07:52,143 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:07:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-08 01:07:52,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40
[2022-04-08 01:07:52,143 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 01:07:52,143 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-08 01:07:52,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6)
[2022-04-08 01:07:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 01:07:52,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 01:07:52,146 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 01:07:52,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 01:07:52,346 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:07:52,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-08 01:07:52,384 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:07:52,384 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed.
[2022-04-08 01:07:52,385 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2022-04-08 01:07:52,385 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-08 01:07:52,385 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true
[2022-04-08 01:07:52,385 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2022-04-08 01:07:52,385 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2022-04-08 01:07:52,385 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true
[2022-04-08 01:07:52,385 INFO L882 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed.
[2022-04-08 01:07:52,387 INFO L882 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed.
[2022-04-08 01:07:52,387 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed.
[2022-04-08 01:07:52,387 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 52) the Hoare annotation is: true
[2022-04-08 01:07:52,387 INFO L885 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true
[2022-04-08 01:07:52,387 INFO L882 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed.
[2022-04-08 01:07:52,387 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true
[2022-04-08 01:07:52,387 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true
[2022-04-08 01:07:52,388 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point L36-3(lines 36 46) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))
[2022-04-08 01:07:52,388 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (= (+ main_~x~0 1) main_~y~0)
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 36 46) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 52) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 52) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed.
[2022-04-08 01:07:52,388 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed.
[2022-04-08 01:07:52,389 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed.
[2022-04-08 01:07:52,391 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2022-04-08 01:07:52,392 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 01:07:52,395 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 01:07:52,395 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2022-04-08 01:07:52,395 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-08 01:07:52,395 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 01:07:52,395 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 01:07:52,396 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation
[2022-04-08 01:07:52,397 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation
[2022-04-08 01:07:52,398 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation
[2022-04-08 01:07:52,398 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-08 01:07:52,398 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-08 01:07:52,398 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-08 01:07:52,398 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-08 01:07:52,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:07:52 BasicIcfg
[2022-04-08 01:07:52,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 01:07:52,407 INFO L158 Benchmark]: Toolchain (without parser) took 10418.55ms. Allocated memory was 179.3MB in the beginning and 217.1MB in the end (delta: 37.7MB). Free memory was 126.8MB in the beginning and 113.6MB in the end (delta: 13.3MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB.
[2022-04-08 01:07:52,407 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory was 143.2MB in the beginning and 143.0MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 01:07:52,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.07ms. Allocated memory was 179.3MB in the beginning and 217.1MB in the end (delta: 37.7MB). Free memory was 126.7MB in the beginning and 193.8MB in the end (delta: -67.2MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB.
[2022-04-08 01:07:52,408 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 217.1MB. Free memory was 193.8MB in the beginning and 192.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 01:07:52,408 INFO L158 Benchmark]: RCFGBuilder took 267.85ms. Allocated memory is still 217.1MB. Free memory was 192.3MB in the beginning and 180.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 01:07:52,408 INFO L158 Benchmark]: IcfgTransformer took 29.55ms. Allocated memory is still 217.1MB. Free memory was 180.2MB in the beginning and 178.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 01:07:52,409 INFO L158 Benchmark]: TraceAbstraction took 9866.70ms. Allocated memory is still 217.1MB. Free memory was 178.1MB in the beginning and 113.6MB in the end (delta: 64.6MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB.
[2022-04-08 01:07:52,410 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.13ms. Allocated memory is still 179.3MB. Free memory was 143.2MB in the beginning and 143.0MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 222.07ms. Allocated memory was 179.3MB in the beginning and 217.1MB in the end (delta: 37.7MB). Free memory was 126.7MB in the beginning and 193.8MB in the end (delta: -67.2MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 26.84ms. Allocated memory is still 217.1MB. Free memory was 193.8MB in the beginning and 192.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 267.85ms. Allocated memory is still 217.1MB. Free memory was 192.3MB in the beginning and 180.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* IcfgTransformer took 29.55ms. Allocated memory is still 217.1MB. Free memory was 180.2MB in the beginning and 178.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* TraceAbstraction took 9866.70ms. Allocated memory is still 217.1MB. Free memory was 178.1MB in the beginning and 113.6MB in the end (delta: 64.6MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 18]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 81 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 23 PreInvPairs, 31 NumberOfFragments, 39 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 1 QuantifiedInterpolants, 246 SizeOfPredicates, 4 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 98/100 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: z * x + 1 == y + x
RESULT: Ultimate proved your program to be correct!
[2022-04-08 01:07:52,426 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...