/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/egcd2-ll_unwindbound1.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-07 19:06:12,689 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-07 19:06:12,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-07 19:06:12,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-07 19:06:12,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-07 19:06:12,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-07 19:06:12,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-07 19:06:12,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-07 19:06:12,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-07 19:06:12,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-07 19:06:12,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-07 19:06:12,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-07 19:06:12,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-07 19:06:12,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-07 19:06:12,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-07 19:06:12,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-07 19:06:12,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-07 19:06:12,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-07 19:06:12,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-07 19:06:12,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-07 19:06:12,742 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-07 19:06:12,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-07 19:06:12,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-07 19:06:12,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-07 19:06:12,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-07 19:06:12,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-07 19:06:12,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-07 19:06:12,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-07 19:06:12,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-07 19:06:12,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-07 19:06:12,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-07 19:06:12,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-07 19:06:12,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-07 19:06:12,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-07 19:06:12,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-07 19:06:12,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-07 19:06:12,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-07 19:06:12,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-07 19:06:12,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-07 19:06:12,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-07 19:06:12,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-07 19:06:12,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-07 19:06:12,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-07 19:06:12,764 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-07 19:06:12,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-07 19:06:12,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-07 19:06:12,765 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-07 19:06:12,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-07 19:06:12,765 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-07 19:06:12,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-07 19:06:12,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-07 19:06:12,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-07 19:06:12,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-07 19:06:12,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-07 19:06:12,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-07 19:06:12,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-07 19:06:12,767 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-07 19:06:12,767 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 19:06:12,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-07 19:06:12,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-07 19:06:12,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-07 19:06:12,960 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-07 19:06:12,961 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-07 19:06:12,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c
[2022-04-07 19:06:13,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8aad52a7/1f3e93b2dbe446f1b1d4d50d6f8bdd58/FLAGf96b5f804
[2022-04-07 19:06:13,384 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-07 19:06:13,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c
[2022-04-07 19:06:13,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8aad52a7/1f3e93b2dbe446f1b1d4d50d6f8bdd58/FLAGf96b5f804
[2022-04-07 19:06:13,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8aad52a7/1f3e93b2dbe446f1b1d4d50d6f8bdd58
[2022-04-07 19:06:13,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-07 19:06:13,404 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-07 19:06:13,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-07 19:06:13,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-07 19:06:13,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-07 19:06:13,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7153f38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13, skipping insertion in model container
[2022-04-07 19:06:13,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-07 19:06:13,426 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-07 19:06:13,556 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/egcd2-ll_unwindbound1.c[490,503]
[2022-04-07 19:06:13,597 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-07 19:06:13,602 INFO L203 MainTranslator]: Completed pre-run
[2022-04-07 19:06:13,628 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/egcd2-ll_unwindbound1.c[490,503]
[2022-04-07 19:06:13,642 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-07 19:06:13,652 INFO L208 MainTranslator]: Completed translation
[2022-04-07 19:06:13,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13 WrapperNode
[2022-04-07 19:06:13,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-07 19:06:13,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-07 19:06:13,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-07 19:06:13,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-07 19:06:13,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-07 19:06:13,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-07 19:06:13,689 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-07 19:06:13,690 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-07 19:06:13,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-07 19:06:13,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 19:06:13,712 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 19:06:13,728 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 19:06:13,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-07 19:06:13,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-07 19:06:13,744 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-07 19:06:13,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-07 19:06:13,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-07 19:06:13,745 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-07 19:06:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-07 19:06:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-07 19:06:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-07 19:06:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-07 19:06:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-07 19:06:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-07 19:06:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-07 19:06:13,790 INFO L234 CfgBuilder]: Building ICFG
[2022-04-07 19:06:13,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-07 19:06:13,915 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-07 19:06:13,919 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-07 19:06:13,920 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-04-07 19:06:13,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:06:13 BoogieIcfgContainer
[2022-04-07 19:06:13,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-07 19:06:13,921 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-07 19:06:13,921 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-07 19:06:13,922 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-07 19:06:13,924 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:06:13" (1/1) ...
[2022-04-07 19:06:13,925 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-07 19:06:13,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:06:13 BasicIcfg
[2022-04-07 19:06:13,948 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-07 19:06:13,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-07 19:06:13,949 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-07 19:06:13,951 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-07 19:06:13,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:06:13" (1/4) ...
[2022-04-07 19:06:13,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1a6d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:06:13, skipping insertion in model container
[2022-04-07 19:06:13,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:13" (2/4) ...
[2022-04-07 19:06:13,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1a6d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:06:13, skipping insertion in model container
[2022-04-07 19:06:13,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:06:13" (3/4) ...
[2022-04-07 19:06:13,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1a6d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:06:13, skipping insertion in model container
[2022-04-07 19:06:13,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:06:13" (4/4) ...
[2022-04-07 19:06:13,952 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound1.cJordan
[2022-04-07 19:06:13,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-07 19:06:13,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-07 19:06:13,988 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-07 19:06:14,002 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 19:06:14,002 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-07 19:06:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-07 19:06:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2022-04-07 19:06:14,033 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 19:06:14,034 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 19:06:14,034 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 19:06:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 19:06:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times
[2022-04-07 19:06:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 19:06:14,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666871513]
[2022-04-07 19:06:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 19:06:14,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 19:06:14,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486804101]
[2022-04-07 19:06:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:14,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:14,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 19:06:14,121 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 19:06:14,160 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 19:06:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:14,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core
[2022-04-07 19:06:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:14,228 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 19:06:14,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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) (= v_~counter~0_5 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_5, #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] {42#true} is VALID
[2022-04-07 19:06:14,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {42#true} is VALID
[2022-04-07 19:06:14,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID
[2022-04-07 19:06:14,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#true} {42#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID
[2022-04-07 19:06:14,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {42#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {42#true} is VALID
[2022-04-07 19:06:14,319 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#true} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID
[2022-04-07 19:06:14,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,320 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#true} {42#true} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,320 INFO L272 TraceCheckUtils]: 22: Hoare triple {42#true} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID
[2022-04-07 19:06:14,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID
[2022-04-07 19:06:14,321 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42#true} {42#true} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID
[2022-04-07 19:06:14,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#true} [116] L40-2-->L40-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID
[2022-04-07 19:06:14,322 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {43#false} is VALID
[2022-04-07 19:06:14,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} [122] __VERIFIER_assertENTRY-->L11: 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] {43#false} is VALID
[2022-04-07 19:06:14,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} [126] L11-->L12: 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[] {43#false} is VALID
[2022-04-07 19:06:14,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID
[2022-04-07 19:06:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-07 19:06:14,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-07 19:06:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 19:06:14,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666871513]
[2022-04-07 19:06:14,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 19:06:14,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486804101]
[2022-04-07 19:06:14,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486804101] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 19:06:14,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 19:06:14,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-07 19:06:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304892460]
[2022-04-07 19:06:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 19:06:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32
[2022-04-07 19:06:14,332 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 19:06:14,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-07 19:06:14,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 19:06:14,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-04-07 19:06:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 19:06:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-04-07 19:06:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-07 19:06:14,372 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-07 19:06:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:14,416 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions.
[2022-04-07 19:06:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-04-07 19:06:14,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32
[2022-04-07 19:06:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 19:06:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-07 19:06:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions.
[2022-04-07 19:06:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-07 19:06:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions.
[2022-04-07 19:06:14,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 54 transitions.
[2022-04-07 19:06:14,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 19:06:14,474 INFO L225 Difference]: With dead ends: 39
[2022-04-07 19:06:14,474 INFO L226 Difference]: Without dead ends: 34
[2022-04-07 19:06:14,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-07 19:06:14,478 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 19:06:14,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 19:06:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2022-04-07 19:06:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2022-04-07 19:06:14,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 19:06:14,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:14,501 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:14,501 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:14,508 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions.
[2022-04-07 19:06:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions.
[2022-04-07 19:06:14,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:14,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:14,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states.
[2022-04-07 19:06:14,511 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states.
[2022-04-07 19:06:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:14,521 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions.
[2022-04-07 19:06:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions.
[2022-04-07 19:06:14,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:14,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:14,523 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 19:06:14,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 19:06:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions.
[2022-04-07 19:06:14,531 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32
[2022-04-07 19:06:14,531 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 19:06:14,532 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions.
[2022-04-07 19:06:14,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2022-04-07 19:06:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions.
[2022-04-07 19:06:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-04-07 19:06:14,534 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 19:06:14,534 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 19:06:14,569 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 19:06:14,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2022-04-07 19:06:14,753 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 19:06:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 19:06:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times
[2022-04-07 19:06:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 19:06:14,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649829734]
[2022-04-07 19:06:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 19:06:14,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 19:06:14,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248512592]
[2022-04-07 19:06:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:14,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:14,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 19:06:14,794 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 19:06:14,812 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 19:06:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:14,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-07 19:06:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:14,890 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 19:06:15,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {280#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {280#true} is VALID
[2022-04-07 19:06:15,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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) (= v_~counter~0_5 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_5, #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] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#(<= ~counter~0 0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#(<= ~counter~0 0)} {280#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#(<= ~counter~0 0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#(<= ~counter~0 0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {288#(<= ~counter~0 0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,093 INFO L272 TraceCheckUtils]: 11: Hoare triple {288#(<= ~counter~0 0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,095 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {288#(<= ~counter~0 0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,096 INFO L272 TraceCheckUtils]: 17: Hoare triple {288#(<= ~counter~0 0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,098 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,098 INFO L272 TraceCheckUtils]: 22: Hoare triple {288#(<= ~counter~0 0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,100 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID
[2022-04-07 19:06:15,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {288#(<= ~counter~0 0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {367#(<= |main_#t~post6| 0)} is VALID
[2022-04-07 19:06:15,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {367#(<= |main_#t~post6| 0)} [119] L40-->L40-3: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {281#false} is VALID
[2022-04-07 19:06:15,102 INFO L272 TraceCheckUtils]: 29: Hoare triple {281#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {281#false} is VALID
[2022-04-07 19:06:15,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {281#false} [122] __VERIFIER_assertENTRY-->L11: 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] {281#false} is VALID
[2022-04-07 19:06:15,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {281#false} [126] L11-->L12: 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[] {281#false} is VALID
[2022-04-07 19:06:15,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {281#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {281#false} is VALID
[2022-04-07 19:06:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-07 19:06:15,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-07 19:06:15,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 19:06:15,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649829734]
[2022-04-07 19:06:15,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 19:06:15,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248512592]
[2022-04-07 19:06:15,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248512592] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 19:06:15,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 19:06:15,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-07 19:06:15,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873728151]
[2022-04-07 19:06:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 19:06:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33
[2022-04-07 19:06:15,105 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 19:06:15,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:15,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 19:06:15,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-07 19:06:15,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 19:06:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-07 19:06:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-07 19:06:15,124 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:15,191 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions.
[2022-04-07 19:06:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-07 19:06:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33
[2022-04-07 19:06:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 19:06:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions.
[2022-04-07 19:06:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions.
[2022-04-07 19:06:15,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions.
[2022-04-07 19:06:15,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 19:06:15,231 INFO L225 Difference]: With dead ends: 36
[2022-04-07 19:06:15,231 INFO L226 Difference]: Without dead ends: 36
[2022-04-07 19:06:15,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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 19:06:15,232 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 19:06:15,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 19:06:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2022-04-07 19:06:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2022-04-07 19:06:15,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 19:06:15,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:15,236 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:15,237 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:15,239 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions.
[2022-04-07 19:06:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions.
[2022-04-07 19:06:15,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:15,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:15,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states.
[2022-04-07 19:06:15,240 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states.
[2022-04-07 19:06:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:15,242 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions.
[2022-04-07 19:06:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions.
[2022-04-07 19:06:15,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:15,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:15,243 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 19:06:15,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 19:06:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions.
[2022-04-07 19:06:15,245 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33
[2022-04-07 19:06:15,245 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 19:06:15,245 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions.
[2022-04-07 19:06:15,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions.
[2022-04-07 19:06:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-07 19:06:15,246 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 19:06:15,246 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 19:06:15,263 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 19:06:15,463 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,SelfDestructingSolverStorable1
[2022-04-07 19:06:15,464 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 19:06:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 19:06:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times
[2022-04-07 19:06:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 19:06:15,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237625646]
[2022-04-07 19:06:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 19:06:15,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 19:06:15,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210466457]
[2022-04-07 19:06:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:15,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 19:06:15,482 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 19:06:15,483 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 19:06:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:15,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-07 19:06:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:15,534 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 19:06:15,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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) (= v_~counter~0_5 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_5, #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] {526#true} is VALID
[2022-04-07 19:06:15,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {526#true} is VALID
[2022-04-07 19:06:15,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID
[2022-04-07 19:06:15,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {526#true} {526#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {526#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {567#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2022-04-07 19:06:15,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-07 19:06:15,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-07 19:06:15,645 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {571#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {578#(<= 1 main_~y~0)} is VALID
[2022-04-07 19:06:15,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,646 INFO L272 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID
[2022-04-07 19:06:15,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,647 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,647 INFO L272 TraceCheckUtils]: 22: Hoare triple {582#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID
[2022-04-07 19:06:15,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,648 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {582#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {582#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {582#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {527#false} is VALID
[2022-04-07 19:06:15,649 INFO L272 TraceCheckUtils]: 30: Hoare triple {527#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {527#false} is VALID
[2022-04-07 19:06:15,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {527#false} [122] __VERIFIER_assertENTRY-->L11: 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] {527#false} is VALID
[2022-04-07 19:06:15,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {527#false} [126] L11-->L12: 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[] {527#false} is VALID
[2022-04-07 19:06:15,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {527#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID
[2022-04-07 19:06:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-07 19:06:15,650 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-07 19:06:15,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {527#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID
[2022-04-07 19:06:15,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {527#false} [126] L11-->L12: 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[] {527#false} is VALID
[2022-04-07 19:06:15,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {527#false} [122] __VERIFIER_assertENTRY-->L11: 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] {527#false} is VALID
[2022-04-07 19:06:15,837 INFO L272 TraceCheckUtils]: 30: Hoare triple {527#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {527#false} is VALID
[2022-04-07 19:06:15,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {582#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {527#false} is VALID
[2022-04-07 19:06:15,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {582#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {582#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,839 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID
[2022-04-07 19:06:15,840 INFO L272 TraceCheckUtils]: 22: Hoare triple {582#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,841 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID
[2022-04-07 19:06:15,841 INFO L272 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {582#(<= 1 main_~b~0)} is VALID
[2022-04-07 19:06:15,842 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {571#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {578#(<= 1 main_~y~0)} is VALID
[2022-04-07 19:06:15,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-07 19:06:15,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID
[2022-04-07 19:06:15,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {697#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID
[2022-04-07 19:06:15,844 INFO L272 TraceCheckUtils]: 11: Hoare triple {526#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {526#true} {526#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID
[2022-04-07 19:06:15,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID
[2022-04-07 19:06:15,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {526#true} is VALID
[2022-04-07 19:06:15,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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) (= v_~counter~0_5 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_5, #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] {526#true} is VALID
[2022-04-07 19:06:15,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID
[2022-04-07 19:06:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2022-04-07 19:06:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 19:06:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237625646]
[2022-04-07 19:06:15,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 19:06:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210466457]
[2022-04-07 19:06:15,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210466457] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-07 19:06:15,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-07 19:06:15,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7
[2022-04-07 19:06:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286683797]
[2022-04-07 19:06:15,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2022-04-07 19:06:15,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34
[2022-04-07 19:06:15,847 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 19:06:15,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:15,867 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 19:06:15,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-07 19:06:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 19:06:15,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-07 19:06:15,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-07 19:06:15,868 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:16,147 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions.
[2022-04-07 19:06:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-07 19:06:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34
[2022-04-07 19:06:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 19:06:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions.
[2022-04-07 19:06:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions.
[2022-04-07 19:06:16,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions.
[2022-04-07 19:06:16,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 19:06:16,202 INFO L225 Difference]: With dead ends: 45
[2022-04-07 19:06:16,202 INFO L226 Difference]: Without dead ends: 45
[2022-04-07 19:06:16,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2022-04-07 19:06:16,204 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-07 19:06:16,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-07 19:06:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2022-04-07 19:06:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37.
[2022-04-07 19:06:16,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 19:06:16,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:16,209 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:16,210 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:16,212 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions.
[2022-04-07 19:06:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions.
[2022-04-07 19:06:16,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:16,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:16,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states.
[2022-04-07 19:06:16,214 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states.
[2022-04-07 19:06:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:16,216 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions.
[2022-04-07 19:06:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions.
[2022-04-07 19:06:16,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:16,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:16,217 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 19:06:16,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 19:06:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-07 19:06:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions.
[2022-04-07 19:06:16,219 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34
[2022-04-07 19:06:16,219 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 19:06:16,219 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions.
[2022-04-07 19:06:16,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions.
[2022-04-07 19:06:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-07 19:06:16,220 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 19:06:16,220 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 19:06:16,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-07 19:06:16,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:16,438 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 19:06:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 19:06:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times
[2022-04-07 19:06:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 19:06:16,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420699966]
[2022-04-07 19:06:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:16,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 19:06:16,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 19:06:16,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972528570]
[2022-04-07 19:06:16,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:16,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:16,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 19:06:16,452 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 19:06:16,453 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 19:06:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:16,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-07 19:06:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 19:06:16,505 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 19:06:16,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID
[2022-04-07 19:06:16,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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) (= v_~counter~0_5 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_5, #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] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#(<= 0 ~counter~0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#(<= 0 ~counter~0)} {912#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#(<= 0 ~counter~0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#(<= 0 ~counter~0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#(<= 0 ~counter~0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,665 INFO L272 TraceCheckUtils]: 11: Hoare triple {920#(<= 0 ~counter~0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,666 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#(<= 0 ~counter~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,668 INFO L272 TraceCheckUtils]: 17: Hoare triple {920#(<= 0 ~counter~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,669 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,670 INFO L272 TraceCheckUtils]: 22: Hoare triple {920#(<= 0 ~counter~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {920#(<= 0 ~counter~0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {920#(<= 0 ~counter~0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {920#(<= 0 ~counter~0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,671 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {920#(<= 0 ~counter~0)} {920#(<= 0 ~counter~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {920#(<= 0 ~counter~0)} is VALID
[2022-04-07 19:06:16,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {920#(<= 0 ~counter~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {999#(<= 1 ~counter~0)} is VALID
[2022-04-07 19:06:16,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {999#(<= 1 ~counter~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {999#(<= 1 ~counter~0)} is VALID
[2022-04-07 19:06:16,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {999#(<= 1 ~counter~0)} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {999#(<= 1 ~counter~0)} is VALID
[2022-04-07 19:06:16,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {999#(<= 1 ~counter~0)} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1009#(<= 1 |main_#t~post7|)} is VALID
[2022-04-07 19:06:16,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {1009#(<= 1 |main_#t~post7|)} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 1) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {913#false} is VALID
[2022-04-07 19:06:16,673 INFO L272 TraceCheckUtils]: 32: Hoare triple {913#false} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {913#false} is VALID
[2022-04-07 19:06:16,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} [122] __VERIFIER_assertENTRY-->L11: 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] {913#false} is VALID
[2022-04-07 19:06:16,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {913#false} [126] L11-->L12: 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[] {913#false} is VALID
[2022-04-07 19:06:16,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {913#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#false} is VALID
[2022-04-07 19:06:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-07 19:06:16,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-07 19:06:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 19:06:16,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420699966]
[2022-04-07 19:06:16,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 19:06:16,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972528570]
[2022-04-07 19:06:16,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972528570] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 19:06:16,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 19:06:16,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-07 19:06:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616686737]
[2022-04-07 19:06:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 19:06:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36
[2022-04-07 19:06:16,675 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-07 19:06:16,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 19:06:16,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-07 19:06:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 19:06:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-07 19:06:16,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-07 19:06:16,697 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:16,763 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions.
[2022-04-07 19:06:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-07 19:06:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36
[2022-04-07 19:06:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 19:06:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions.
[2022-04-07 19:06:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions.
[2022-04-07 19:06:16,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions.
[2022-04-07 19:06:16,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-07 19:06:16,790 INFO L225 Difference]: With dead ends: 32
[2022-04-07 19:06:16,790 INFO L226 Difference]: Without dead ends: 32
[2022-04-07 19:06:16,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2022-04-07 19:06:16,790 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-07 19:06:16,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-07 19:06:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2022-04-07 19:06:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2022-04-07 19:06:16,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 19:06:16,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-07 19:06:16,793 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-07 19:06:16,793 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-07 19:06:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:16,795 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions.
[2022-04-07 19:06:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions.
[2022-04-07 19:06:16,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:16,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:16,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states.
[2022-04-07 19:06:16,795 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states.
[2022-04-07 19:06:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 19:06:16,796 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions.
[2022-04-07 19:06:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions.
[2022-04-07 19:06:16,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 19:06:16,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 19:06:16,797 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-07 19:06:16,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 19:06:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-07 19:06:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions.
[2022-04-07 19:06:16,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 36
[2022-04-07 19:06:16,798 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-07 19:06:16,799 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions.
[2022-04-07 19:06:16,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 19:06:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions.
[2022-04-07 19:06:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2022-04-07 19:06:16,799 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-07 19:06:16,799 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 19:06:16,837 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 19:06:17,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:17,016 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 19:06:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 19:06:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times
[2022-04-07 19:06:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 19:06:17,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690109270]
[2022-04-07 19:06:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 19:06:17,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 19:06:17,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142896418]
[2022-04-07 19:06:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 19:06:17,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 19:06:17,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-07 19:06:17,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-04-07 19:06:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-07 19:06:17,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-07 19:06:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-07 19:06:17,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-07 19:06:17,100 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-07 19:06:17,101 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-07 19:06:17,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2022-04-07 19:06:17,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 19:06:17,321 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-04-07 19:06:17,323 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-07 19:06:17,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:06:17 BasicIcfg
[2022-04-07 19:06:17,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-07 19:06:17,348 INFO L158 Benchmark]: Toolchain (without parser) took 3943.76ms. Allocated memory was 211.8MB in the beginning and 335.5MB in the end (delta: 123.7MB). Free memory was 163.0MB in the beginning and 155.3MB in the end (delta: 7.8MB). Peak memory consumption was 131.4MB. Max. memory is 8.0GB.
[2022-04-07 19:06:17,348 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory was 179.8MB in the beginning and 179.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-07 19:06:17,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.83ms. Allocated memory is still 211.8MB. Free memory was 162.8MB in the beginning and 186.8MB in the end (delta: -24.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-07 19:06:17,349 INFO L158 Benchmark]: Boogie Preprocessor took 36.09ms. Allocated memory is still 211.8MB. Free memory was 186.8MB in the beginning and 185.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-07 19:06:17,349 INFO L158 Benchmark]: RCFGBuilder took 231.46ms. Allocated memory is still 211.8MB. Free memory was 185.2MB in the beginning and 172.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
[2022-04-07 19:06:17,349 INFO L158 Benchmark]: IcfgTransformer took 26.64ms. Allocated memory is still 211.8MB. Free memory was 172.1MB in the beginning and 170.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-07 19:06:17,350 INFO L158 Benchmark]: TraceAbstraction took 3398.40ms. Allocated memory was 211.8MB in the beginning and 335.5MB in the end (delta: 123.7MB). Free memory was 170.0MB in the beginning and 155.3MB in the end (delta: 14.7MB). Peak memory consumption was 139.5MB. Max. memory is 8.0GB.
[2022-04-07 19:06:17,351 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.11ms. Allocated memory is still 211.8MB. Free memory was 179.8MB in the beginning and 179.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 245.83ms. Allocated memory is still 211.8MB. Free memory was 162.8MB in the beginning and 186.8MB in the end (delta: -24.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 36.09ms. Allocated memory is still 211.8MB. Free memory was 186.8MB in the beginning and 185.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 231.46ms. Allocated memory is still 211.8MB. Free memory was 185.2MB in the beginning and 172.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
* IcfgTransformer took 26.64ms. Allocated memory is still 211.8MB. Free memory was 172.1MB in the beginning and 170.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* TraceAbstraction took 3398.40ms. Allocated memory was 211.8MB in the beginning and 335.5MB in the end (delta: 123.7MB). Free memory was 170.0MB in the beginning and 155.3MB in the end (delta: 14.7MB). Peak memory consumption was 139.5MB. 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
- CounterExampleResult [Line: 13]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L18] int counter = 0;
VAL [\old(counter)=6, counter=0]
[L20] int x, y;
[L21] long long a, b, p, q, r, s, c, k, xy, yy;
[L22] x = __VERIFIER_nondet_int()
[L23] y = __VERIFIER_nondet_int()
[L24] CALL assume_abort_if_not(x >= 1)
VAL [\old(cond)=1, \old(counter)=0, counter=0]
[L8] COND FALSE !(!cond)
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0]
[L24] RET assume_abort_if_not(x >= 1)
VAL [\old(counter)=0, counter=0, x=1, y=1]
[L25] CALL assume_abort_if_not(y >= 1)
VAL [\old(cond)=1, \old(counter)=0, counter=0]
[L8] COND FALSE !(!cond)
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0]
[L25] RET assume_abort_if_not(y >= 1)
VAL [\old(counter)=0, counter=0, x=1, y=1]
[L27] a = x
[L28] b = y
[L29] p = 1
[L30] q = 0
[L31] r = 0
[L32] s = 1
[L33] c = 0
[L34] k = 0
[L35] xy = (long long) x * y
[L36] yy = (long long) y * y
VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1]
[L37] CALL assume_abort_if_not(xy < 2147483647)
VAL [\old(cond)=1, \old(counter)=0, counter=0]
[L8] COND FALSE !(!cond)
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0]
[L37] RET assume_abort_if_not(xy < 2147483647)
VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1]
[L38] CALL assume_abort_if_not(yy < 2147483647)
VAL [\old(cond)=1, \old(counter)=0, counter=0]
[L8] COND FALSE !(!cond)
VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0]
[L38] RET assume_abort_if_not(yy < 2147483647)
VAL [\old(counter)=0, a=1, b=1, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1]
[L40] EXPR counter++
VAL [\old(counter)=0, a=1, b=1, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1]
[L40] COND TRUE counter++<1
[L41] COND FALSE !(!(b != 0))
[L43] c = a
[L44] k = 0
VAL [\old(counter)=0, a=1, b=1, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1]
[L46] EXPR counter++
VAL [\old(counter)=0, a=1, b=1, c=1, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=1, y=1, yy=1]
[L46] COND FALSE !(counter++<1)
[L57] a = b
[L58] b = c
[L60] long long temp;
[L61] temp = p
[L62] p = q
[L63] q = temp - q * k
[L64] temp = r
[L65] r = s
[L66] s = temp - s * k
VAL [\old(counter)=0, a=1, b=1, c=1, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=1, y=1, yy=1]
[L40] EXPR counter++
VAL [\old(counter)=0, a=1, b=1, c=1, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=1, y=1, yy=1]
[L40] COND FALSE !(counter++<1)
[L70] CALL __VERIFIER_assert(q*x + s*y == 0)
VAL [\old(cond)=0, \old(counter)=0, counter=3]
[L11] COND TRUE !(cond)
VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3]
[L13] reach_error()
VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 163 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 5 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 108/120 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
RESULT: Ultimate proved your program to be incorrect!
[2022-04-07 19:06:17,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...