/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound10.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-07 20:42:41,813 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-07 20:42:41,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-07 20:42:41,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-07 20:42:41,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-07 20:42:41,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-07 20:42:41,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-07 20:42:41,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-07 20:42:41,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-07 20:42:41,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-07 20:42:41,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-07 20:42:41,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-07 20:42:41,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-07 20:42:41,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-07 20:42:41,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-07 20:42:41,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-07 20:42:41,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-07 20:42:41,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-07 20:42:41,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-07 20:42:41,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-07 20:42:41,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-07 20:42:41,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-07 20:42:41,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-07 20:42:41,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-07 20:42:41,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-07 20:42:41,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-07 20:42:41,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-07 20:42:41,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-07 20:42:41,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-07 20:42:41,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-07 20:42:41,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-07 20:42:41,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-07 20:42:41,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-07 20:42:41,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-07 20:42:41,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-07 20:42:41,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-07 20:42:41,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-07 20:42:41,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-07 20:42:41,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-07 20:42:41,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-07 20:42:41,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-07 20:42:41,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-07 20:42:41,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-07 20:42:41,918 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-07 20:42:41,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-07 20:42:41,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-07 20:42:41,919 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-07 20:42:41,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-07 20:42:41,919 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-07 20:42:41,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-07 20:42:41,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-07 20:42:41,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-07 20:42:41,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-07 20:42:41,920 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-07 20:42:41,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-07 20:42:41,920 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-07 20:42:41,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-07 20:42:41,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-07 20:42:41,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-07 20:42:41,920 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-07 20:42:41,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-07 20:42:41,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-07 20:42:41,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-07 20:42:41,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-07 20:42:41,921 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-07 20:42:41,922 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN
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-07 20:42:42,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-07 20:42:42,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-07 20:42:42,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-07 20:42:42,093 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-07 20:42:42,094 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-07 20:42:42,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound10.c
[2022-04-07 20:42:42,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702677890/16d9ca9f9eed4c65b32cca3a83bd2d41/FLAGf29ace8f6
[2022-04-07 20:42:42,477 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-07 20:42:42,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound10.c
[2022-04-07 20:42:42,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702677890/16d9ca9f9eed4c65b32cca3a83bd2d41/FLAGf29ace8f6
[2022-04-07 20:42:42,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702677890/16d9ca9f9eed4c65b32cca3a83bd2d41
[2022-04-07 20:42:42,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-07 20:42:42,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-07 20:42:42,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-07 20:42:42,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-07 20:42:42,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-07 20:42:42,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28399baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42, skipping insertion in model container
[2022-04-07 20:42:42,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-07 20:42:42,508 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-07 20:42:42,613 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/ps2-ll_unwindbound10.c[454,467]
[2022-04-07 20:42:42,622 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-07 20:42:42,629 INFO L203 MainTranslator]: Completed pre-run
[2022-04-07 20:42:42,636 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/ps2-ll_unwindbound10.c[454,467]
[2022-04-07 20:42:42,639 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-07 20:42:42,646 INFO L208 MainTranslator]: Completed translation
[2022-04-07 20:42:42,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42 WrapperNode
[2022-04-07 20:42:42,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-07 20:42:42,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-07 20:42:42,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-07 20:42:42,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-07 20:42:42,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-07 20:42:42,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-07 20:42:42,664 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-07 20:42:42,664 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-07 20:42:42,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-07 20:42:42,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 20:42:42,682 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-07 20:42:42,688 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-07 20:42:42,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-07 20:42:42,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-07 20:42:42,705 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-07 20:42:42,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-07 20:42:42,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-07 20:42:42,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-07 20:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-07 20:42:42,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-07 20:42:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-07 20:42:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-07 20:42:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-07 20:42:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-07 20:42:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-07 20:42:42,748 INFO L234 CfgBuilder]: Building ICFG
[2022-04-07 20:42:42,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-07 20:42:42,834 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-07 20:42:42,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-07 20:42:42,838 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-07 20:42:42,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:42:42 BoogieIcfgContainer
[2022-04-07 20:42:42,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-07 20:42:42,840 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-07 20:42:42,840 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-07 20:42:42,841 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-07 20:42:42,850 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:42:42" (1/1) ...
[2022-04-07 20:42:42,852 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-07 20:42:42,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:42:42 BasicIcfg
[2022-04-07 20:42:42,888 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-07 20:42:42,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-07 20:42:42,889 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-07 20:42:42,891 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-07 20:42:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 08:42:42" (1/4) ...
[2022-04-07 20:42:42,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134dce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:42:42, skipping insertion in model container
[2022-04-07 20:42:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:42:42" (2/4) ...
[2022-04-07 20:42:42,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134dce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:42:42, skipping insertion in model container
[2022-04-07 20:42:42,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:42:42" (3/4) ...
[2022-04-07 20:42:42,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134dce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:42:42, skipping insertion in model container
[2022-04-07 20:42:42,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:42:42" (4/4) ...
[2022-04-07 20:42:42,893 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_unwindbound10.cJordan
[2022-04-07 20:42:42,895 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-07 20:42:42,895 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-07 20:42:42,920 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-07 20:42:42,924 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-07 20:42:42,924 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-07 20:42:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-07 20:42:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-07 20:42:42,945 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 20:42:42,945 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 20:42:42,945 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 20:42:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 20:42:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -630084848, now seen corresponding path program 1 times
[2022-04-07 20:42:42,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 20:42:42,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407321949]
[2022-04-07 20:42:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 20:42:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:43,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-07 20:42:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:43,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID
[2022-04-07 20:42:43,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-07 20:42:43,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-07 20:42:43,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-07 20:42:43,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {25#true} is VALID
[2022-04-07 20:42:43,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-07 20:42:43,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-07 20:42:43,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-07 20:42:43,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {25#true} is VALID
[2022-04-07 20:42:43,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [63] L27-3-->L27-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID
[2022-04-07 20:42:43,125 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 2) v_main_~x~0_9) v_main_~y~0_9 (* v_main_~y~0_9 v_main_~y~0_9)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {26#false} is VALID
[2022-04-07 20:42:43,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID
[2022-04-07 20:42:43,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [72] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID
[2022-04-07 20:42:43,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID
[2022-04-07 20:42:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-07 20:42:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 20:42:43,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407321949]
[2022-04-07 20:42:43,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407321949] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 20:42:43,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 20:42:43,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-07 20:42:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691881395]
[2022-04-07 20:42:43,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 20:42:43,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-07 20:42:43,133 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 20:42:43,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:43,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-07 20:42:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 20:42:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-07 20:42:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-07 20:42:43,170 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:43,251 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions.
[2022-04-07 20:42:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-07 20:42:43,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-07 20:42:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 20:42:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions.
[2022-04-07 20:42:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions.
[2022-04-07 20:42:43,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions.
[2022-04-07 20:42:43,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:43,315 INFO L225 Difference]: With dead ends: 23
[2022-04-07 20:42:43,315 INFO L226 Difference]: Without dead ends: 18
[2022-04-07 20:42:43,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-07 20:42:43,318 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 20:42:43,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 20:42:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2022-04-07 20:42:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17.
[2022-04-07 20:42:43,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 20:42:43,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,340 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,340 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:43,346 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions.
[2022-04-07 20:42:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2022-04-07 20:42:43,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:43,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:43,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states.
[2022-04-07 20:42:43,348 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states.
[2022-04-07 20:42:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:43,350 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions.
[2022-04-07 20:42:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2022-04-07 20:42:43,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:43,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:43,351 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 20:42:43,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 20:42:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions.
[2022-04-07 20:42:43,353 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11
[2022-04-07 20:42:43,354 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 20:42:43,354 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions.
[2022-04-07 20:42:43,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions.
[2022-04-07 20:42:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-07 20:42:43,356 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 20:42:43,356 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 20:42:43,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-07 20:42:43,359 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 20:42:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 20:42:43,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1971636769, now seen corresponding path program 1 times
[2022-04-07 20:42:43,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 20:42:43,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969238515]
[2022-04-07 20:42:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 20:42:43,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 20:42:43,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855847132]
[2022-04-07 20:42:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:43,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 20:42:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 20:42:43,388 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-07 20:42:43,389 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-07 20:42:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:43,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-07 20:42:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:43,443 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 20:42:43,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {109#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID
[2022-04-07 20:42:43,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {117#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:43,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:43,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117#(<= ~counter~0 0)} {109#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:43,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {117#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:43,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#(<= ~counter~0 0)} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {117#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:43,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#(<= ~counter~0 0)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {133#(<= |main_#t~post5| 0)} is VALID
[2022-04-07 20:42:43,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(<= |main_#t~post5| 0)} [66] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {110#false} is VALID
[2022-04-07 20:42:43,555 INFO L272 TraceCheckUtils]: 8: Hoare triple {110#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 2) v_main_~x~0_9) v_main_~y~0_9 (* v_main_~y~0_9 v_main_~y~0_9)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {110#false} is VALID
[2022-04-07 20:42:43,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#false} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {110#false} is VALID
[2022-04-07 20:42:43,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#false} [72] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {110#false} is VALID
[2022-04-07 20:42:43,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {110#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#false} is VALID
[2022-04-07 20:42:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-07 20:42:43,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-07 20:42:43,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 20:42:43,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969238515]
[2022-04-07 20:42:43,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 20:42:43,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855847132]
[2022-04-07 20:42:43,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855847132] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 20:42:43,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 20:42:43,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-07 20:42:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125703627]
[2022-04-07 20:42:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 20:42:43,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-07 20:42:43,558 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 20:42:43,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:43,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-07 20:42:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 20:42:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-07 20:42:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-07 20:42:43,573 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:43,608 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions.
[2022-04-07 20:42:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-07 20:42:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-07 20:42:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 20:42:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions.
[2022-04-07 20:42:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions.
[2022-04-07 20:42:43,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions.
[2022-04-07 20:42:43,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:43,638 INFO L225 Difference]: With dead ends: 19
[2022-04-07 20:42:43,638 INFO L226 Difference]: Without dead ends: 19
[2022-04-07 20:42:43,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-07 20:42:43,643 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 20:42:43,644 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 20:42:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2022-04-07 20:42:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2022-04-07 20:42:43,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 20:42:43,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,649 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,649 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:43,651 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions.
[2022-04-07 20:42:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-07 20:42:43,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:43,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:43,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states.
[2022-04-07 20:42:43,653 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states.
[2022-04-07 20:42:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:43,654 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions.
[2022-04-07 20:42:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-07 20:42:43,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:43,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:43,655 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 20:42:43,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 20:42:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions.
[2022-04-07 20:42:43,658 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12
[2022-04-07 20:42:43,658 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 20:42:43,658 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions.
[2022-04-07 20:42:43,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-07 20:42:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-07 20:42:43,659 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 20:42:43,659 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 20:42:43,676 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-07 20:42:43,876 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-07 20:42:43,876 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 20:42:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 20:42:43,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1972709245, now seen corresponding path program 1 times
[2022-04-07 20:42:43,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 20:42:43,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993526339]
[2022-04-07 20:42:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 20:42:43,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 20:42:43,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502229227]
[2022-04-07 20:42:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:43,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 20:42:43,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 20:42:43,889 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-07 20:42:43,891 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-07 20:42:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:43,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-07 20:42:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:43,928 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 20:42:44,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID
[2022-04-07 20:42:44,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {224#true} is VALID
[2022-04-07 20:42:44,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID
[2022-04-07 20:42:44,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID
[2022-04-07 20:42:44,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#true} is VALID
[2022-04-07 20:42:44,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {244#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-07 20:42:44,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(and (= main_~x~0 0) (= main_~y~0 0))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {244#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-07 20:42:44,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {244#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-07 20:42:44,028 INFO L272 TraceCheckUtils]: 8: Hoare triple {244#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-07 20:42:44,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {258#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-07 20:42:44,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} [72] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {225#false} is VALID
[2022-04-07 20:42:44,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#false} is VALID
[2022-04-07 20:42:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-07 20:42:44,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-07 20:42:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 20:42:44,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993526339]
[2022-04-07 20:42:44,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 20:42:44,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502229227]
[2022-04-07 20:42:44,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502229227] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 20:42:44,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 20:42:44,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-07 20:42:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835529188]
[2022-04-07 20:42:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 20:42:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-07 20:42:44,035 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 20:42:44,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:44,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:44,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-07 20:42:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 20:42:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-07 20:42:44,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-07 20:42:44,046 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:44,123 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-07 20:42:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-07 20:42:44,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-07 20:42:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 20:42:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions.
[2022-04-07 20:42:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions.
[2022-04-07 20:42:44,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions.
[2022-04-07 20:42:44,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:44,149 INFO L225 Difference]: With dead ends: 26
[2022-04-07 20:42:44,150 INFO L226 Difference]: Without dead ends: 25
[2022-04-07 20:42:44,150 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-07 20:42:44,151 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 20:42:44,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 20:42:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2022-04-07 20:42:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2022-04-07 20:42:44,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 20:42:44,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-07 20:42:44,153 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-07 20:42:44,153 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-07 20:42:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:44,155 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions.
[2022-04-07 20:42:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-07 20:42:44,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:44,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:44,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states.
[2022-04-07 20:42:44,155 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states.
[2022-04-07 20:42:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:44,157 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions.
[2022-04-07 20:42:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-07 20:42:44,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:44,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:44,157 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 20:42:44,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 20:42:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-07 20:42:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions.
[2022-04-07 20:42:44,158 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12
[2022-04-07 20:42:44,158 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 20:42:44,158 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions.
[2022-04-07 20:42:44,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-07 20:42:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-07 20:42:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-07 20:42:44,159 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 20:42:44,159 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 20:42:44,179 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-07 20:42:44,371 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-07 20:42:44,371 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 20:42:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 20:42:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -832305310, now seen corresponding path program 1 times
[2022-04-07 20:42:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 20:42:44,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750884194]
[2022-04-07 20:42:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 20:42:44,382 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 20:42:44,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507470097]
[2022-04-07 20:42:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:44,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 20:42:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 20:42:44,383 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-07 20:42:44,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-07 20:42:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:44,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-07 20:42:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:44,428 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 20:42:44,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID
[2022-04-07 20:42:44,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {375#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:44,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#(<= ~counter~0 0)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:44,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {375#(<= ~counter~0 0)} {367#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:44,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {375#(<= ~counter~0 0)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:44,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#(<= ~counter~0 0)} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {375#(<= ~counter~0 0)} is VALID
[2022-04-07 20:42:44,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(<= ~counter~0 0)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(<= ~counter~0 1)} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,558 INFO L272 TraceCheckUtils]: 8: Hoare triple {391#(<= ~counter~0 1)} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(<= ~counter~0 1)} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#(<= ~counter~0 1)} [73] L10-->L10-2: Formula: (not (= 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[] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {391#(<= ~counter~0 1)} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,560 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {391#(<= ~counter~0 1)} {391#(<= ~counter~0 1)} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#(<= ~counter~0 1)} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< v_main_~c~0_6 v_main_~k~0_5) (= v_main_~x~0_5 (+ v_main_~x~0_6 v_main_~y~0_5)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {391#(<= ~counter~0 1)} is VALID
[2022-04-07 20:42:44,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#(<= ~counter~0 1)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {416#(<= |main_#t~post5| 1)} is VALID
[2022-04-07 20:42:44,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#(<= |main_#t~post5| 1)} [66] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {368#false} is VALID
[2022-04-07 20:42:44,561 INFO L272 TraceCheckUtils]: 16: Hoare triple {368#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 2) v_main_~x~0_9) v_main_~y~0_9 (* v_main_~y~0_9 v_main_~y~0_9)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {368#false} is VALID
[2022-04-07 20:42:44,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#false} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {368#false} is VALID
[2022-04-07 20:42:44,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#false} [72] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {368#false} is VALID
[2022-04-07 20:42:44,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {368#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID
[2022-04-07 20:42:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-07 20:42:44,562 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-07 20:42:44,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {368#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#false} is VALID
[2022-04-07 20:42:44,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#false} [72] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {368#false} is VALID
[2022-04-07 20:42:44,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#false} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {368#false} is VALID
[2022-04-07 20:42:44,698 INFO L272 TraceCheckUtils]: 16: Hoare triple {368#false} [65] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 2) v_main_~x~0_9) v_main_~y~0_9 (* v_main_~y~0_9 v_main_~y~0_9)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {368#false} is VALID
[2022-04-07 20:42:44,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {444#(< |main_#t~post5| 10)} [66] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {368#false} is VALID
[2022-04-07 20:42:44,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {448#(< ~counter~0 10)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {444#(< |main_#t~post5| 10)} is VALID
[2022-04-07 20:42:44,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {448#(< ~counter~0 10)} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< v_main_~c~0_6 v_main_~k~0_5) (= v_main_~x~0_5 (+ v_main_~x~0_6 v_main_~y~0_5)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {448#(< ~counter~0 10)} is VALID
[2022-04-07 20:42:44,700 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {367#true} {448#(< ~counter~0 10)} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {448#(< ~counter~0 10)} is VALID
[2022-04-07 20:42:44,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {367#true} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID
[2022-04-07 20:42:44,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {367#true} [73] L10-->L10-2: Formula: (not (= 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[] {367#true} is VALID
[2022-04-07 20:42:44,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#true} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {367#true} is VALID
[2022-04-07 20:42:44,700 INFO L272 TraceCheckUtils]: 8: Hoare triple {448#(< ~counter~0 10)} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {367#true} is VALID
[2022-04-07 20:42:44,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {448#(< ~counter~0 10)} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {448#(< ~counter~0 10)} is VALID
[2022-04-07 20:42:44,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(< ~counter~0 9)} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {448#(< ~counter~0 10)} is VALID
[2022-04-07 20:42:44,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {473#(< ~counter~0 9)} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {473#(< ~counter~0 9)} is VALID
[2022-04-07 20:42:44,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {473#(< ~counter~0 9)} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(< ~counter~0 9)} is VALID
[2022-04-07 20:42:44,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {473#(< ~counter~0 9)} {367#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(< ~counter~0 9)} is VALID
[2022-04-07 20:42:44,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {473#(< ~counter~0 9)} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(< ~counter~0 9)} is VALID
[2022-04-07 20:42:44,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {473#(< ~counter~0 9)} is VALID
[2022-04-07 20:42:44,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#true} is VALID
[2022-04-07 20:42:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-07 20:42:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 20:42:44,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750884194]
[2022-04-07 20:42:44,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 20:42:44,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507470097]
[2022-04-07 20:42:44,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507470097] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-07 20:42:44,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-07 20:42:44,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2022-04-07 20:42:44,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437071299]
[2022-04-07 20:42:44,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-07 20:42:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20
[2022-04-07 20:42:44,708 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 20:42:44,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2022-04-07 20:42:44,735 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-07 20:42:44,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-07 20:42:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 20:42:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-07 20:42:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2022-04-07 20:42:44,736 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2022-04-07 20:42:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:44,855 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions.
[2022-04-07 20:42:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-07 20:42:44,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20
[2022-04-07 20:42:44,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 20:42:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2022-04-07 20:42:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions.
[2022-04-07 20:42:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2022-04-07 20:42:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions.
[2022-04-07 20:42:44,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions.
[2022-04-07 20:42:44,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:44,908 INFO L225 Difference]: With dead ends: 49
[2022-04-07 20:42:44,908 INFO L226 Difference]: Without dead ends: 49
[2022-04-07 20:42:44,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-04-07 20:42:44,910 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 20:42:44,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 20:42:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2022-04-07 20:42:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45.
[2022-04-07 20:42:44,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 20:42:44,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-07 20:42:44,920 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-07 20:42:44,921 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-07 20:42:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:44,925 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions.
[2022-04-07 20:42:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions.
[2022-04-07 20:42:44,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:44,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:44,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states.
[2022-04-07 20:42:44,926 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states.
[2022-04-07 20:42:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:44,927 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions.
[2022-04-07 20:42:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions.
[2022-04-07 20:42:44,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:44,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:44,928 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 20:42:44,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 20:42:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-07 20:42:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions.
[2022-04-07 20:42:44,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20
[2022-04-07 20:42:44,930 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 20:42:44,930 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions.
[2022-04-07 20:42:44,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)
[2022-04-07 20:42:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions.
[2022-04-07 20:42:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-07 20:42:44,930 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 20:42:44,930 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 20:42:44,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2022-04-07 20:42:45,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 20:42:45,139 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 20:42:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 20:42:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash -831232834, now seen corresponding path program 1 times
[2022-04-07 20:42:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 20:42:45,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970244844]
[2022-04-07 20:42:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 20:42:45,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 20:42:45,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010456816]
[2022-04-07 20:42:45,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 20:42:45,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 20:42:45,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 20:42:45,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-07 20:42:45,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-07 20:42:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:45,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-07 20:42:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 20:42:45,200 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 20:42:45,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {692#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {692#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {692#true} is VALID
[2022-04-07 20:42:45,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {692#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {692#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {692#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {712#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-07 20:42:45,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#(and (= main_~x~0 0) (= main_~y~0 0))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {712#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-07 20:42:45,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {712#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-07 20:42:45,288 INFO L272 TraceCheckUtils]: 8: Hoare triple {712#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {692#true} is VALID
[2022-04-07 20:42:45,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {692#true} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {692#true} is VALID
[2022-04-07 20:42:45,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {692#true} [73] L10-->L10-2: Formula: (not (= 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[] {692#true} is VALID
[2022-04-07 20:42:45,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {692#true} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,290 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {692#true} {712#(and (= main_~x~0 0) (= main_~y~0 0))} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {712#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-07 20:42:45,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#(and (= main_~x~0 0) (= main_~y~0 0))} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< v_main_~c~0_6 v_main_~k~0_5) (= v_main_~x~0_5 (+ v_main_~x~0_6 v_main_~y~0_5)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {737#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID
[2022-04-07 20:42:45,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {737#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID
[2022-04-07 20:42:45,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {737#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID
[2022-04-07 20:42:45,296 INFO L272 TraceCheckUtils]: 16: Hoare triple {737#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {747#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-07 20:42:45,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {747#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {751#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-07 20:42:45,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {751#(<= 1 __VERIFIER_assert_~cond)} [72] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {693#false} is VALID
[2022-04-07 20:42:45,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {693#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#false} is VALID
[2022-04-07 20:42:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-07 20:42:45,297 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-07 20:42:45,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {693#false} [76] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#false} is VALID
[2022-04-07 20:42:45,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {751#(<= 1 __VERIFIER_assert_~cond)} [72] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {693#false} is VALID
[2022-04-07 20:42:45,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {747#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {751#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-07 20:42:45,391 INFO L272 TraceCheckUtils]: 16: Hoare triple {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {747#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-07 20:42:45,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID
[2022-04-07 20:42:45,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID
[2022-04-07 20:42:45,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [75] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< v_main_~c~0_6 v_main_~k~0_5) (= v_main_~x~0_5 (+ v_main_~x~0_6 v_main_~y~0_5)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID
[2022-04-07 20:42:45,472 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {692#true} {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [81] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID
[2022-04-07 20:42:45,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {692#true} [78] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {692#true} [73] L10-->L10-2: Formula: (not (= 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[] {692#true} is VALID
[2022-04-07 20:42:45,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {692#true} [69] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {692#true} is VALID
[2022-04-07 20:42:45,472 INFO L272 TraceCheckUtils]: 8: Hoare triple {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ v_main_~y~0_8 (* (- 2) v_main_~x~0_8) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {692#true} is VALID
[2022-04-07 20:42:45,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [67] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID
[2022-04-07 20:42:45,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} [64] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID
[2022-04-07 20:42:45,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {692#true} [61] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {767#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID
[2022-04-07 20:42:45,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {692#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} [79] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {692#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {692#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {692#true} is VALID
[2022-04-07 20:42:45,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {692#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {692#true} is VALID
[2022-04-07 20:42:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-04-07 20:42:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 20:42:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970244844]
[2022-04-07 20:42:45,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 20:42:45,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010456816]
[2022-04-07 20:42:45,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010456816] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-07 20:42:45,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-07 20:42:45,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7
[2022-04-07 20:42:45,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876313358]
[2022-04-07 20:42:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 20:42:45,476 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-07 20:42:45,476 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 20:42:45,476 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:45,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:45,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-07 20:42:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 20:42:45,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-07 20:42:45,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-07 20:42:45,489 INFO L87 Difference]: Start difference. First operand 45 states and 51 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:45,533 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions.
[2022-04-07 20:42:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-07 20:42:45,534 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-07 20:42:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 20:42:45,534 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions.
[2022-04-07 20:42:45,535 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions.
[2022-04-07 20:42:45,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 18 transitions.
[2022-04-07 20:42:45,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 20:42:45,549 INFO L225 Difference]: With dead ends: 43
[2022-04-07 20:42:45,549 INFO L226 Difference]: Without dead ends: 0
[2022-04-07 20:42:45,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2022-04-07 20:42:45,549 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 20:42:45,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 20:42:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-07 20:42:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-07 20:42:45,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 20:42:45,550 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-07 20:42:45,550 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-07 20:42:45,550 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-07 20:42:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:45,550 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-07 20:42:45,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-07 20:42:45,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:45,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:45,550 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-07 20:42:45,551 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-07 20:42:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 20:42:45,551 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-07 20:42:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-07 20:42:45,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:45,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 20:42:45,551 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 20:42:45,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 20:42:45,551 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-07 20:42:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-07 20:42:45,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20
[2022-04-07 20:42:45,551 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 20:42:45,551 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-07 20:42:45,551 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-07 20:42:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-07 20:42:45,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 20:42:45,553 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-07 20:42:45,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-04-07 20:42:45,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 20:42:45,756 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-04-07 20:42:45,757 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-07 20:42:45,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:42:45 BasicIcfg
[2022-04-07 20:42:45,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-07 20:42:45,759 INFO L158 Benchmark]: Toolchain (without parser) took 3266.27ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 152.5MB in the beginning and 95.9MB in the end (delta: 56.6MB). Peak memory consumption was 97.8MB. Max. memory is 8.0GB.
[2022-04-07 20:42:45,759 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-07 20:42:45,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.23ms. Allocated memory is still 200.3MB. Free memory was 152.3MB in the beginning and 176.7MB in the end (delta: -24.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2022-04-07 20:42:45,760 INFO L158 Benchmark]: Boogie Preprocessor took 16.55ms. Allocated memory is still 200.3MB. Free memory was 176.7MB in the beginning and 175.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-07 20:42:45,760 INFO L158 Benchmark]: RCFGBuilder took 174.89ms. Allocated memory is still 200.3MB. Free memory was 175.2MB in the beginning and 164.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-07 20:42:45,760 INFO L158 Benchmark]: IcfgTransformer took 48.48ms. Allocated memory is still 200.3MB. Free memory was 164.8MB in the beginning and 163.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-07 20:42:45,760 INFO L158 Benchmark]: TraceAbstraction took 2869.46ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 163.1MB in the beginning and 95.9MB in the end (delta: 67.2MB). Peak memory consumption was 109.7MB. Max. memory is 8.0GB.
[2022-04-07 20:42:45,761 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 153.23ms. Allocated memory is still 200.3MB. Free memory was 152.3MB in the beginning and 176.7MB in the end (delta: -24.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 16.55ms. Allocated memory is still 200.3MB. Free memory was 176.7MB in the beginning and 175.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 174.89ms. Allocated memory is still 200.3MB. Free memory was 175.2MB in the beginning and 164.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* IcfgTransformer took 48.48ms. Allocated memory is still 200.3MB. Free memory was 164.8MB in the beginning and 163.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* TraceAbstraction took 2869.46ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 163.1MB in the beginning and 95.9MB in the end (delta: 67.2MB). Peak memory consumption was 109.7MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 12]: 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 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 89 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 5 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 11/18 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
RESULT: Ultimate proved your program to be correct!
[2022-04-07 20:42:45,775 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...