/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound1.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 14:58:14,520 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-04-15 14:58:14,522 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 14:58:14,561 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 14:58:14,561 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 14:58:14,562 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 14:58:14,563 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 14:58:14,564 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 14:58:14,566 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 14:58:14,566 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 14:58:14,567 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 14:58:14,568 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 14:58:14,568 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 14:58:14,569 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 14:58:14,570 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 14:58:14,571 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 14:58:14,571 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 14:58:14,572 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 14:58:14,574 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 14:58:14,575 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 14:58:14,576 INFO  L181        SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 14:58:14,581 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 14:58:14,583 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 14:58:14,586 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 14:58:14,587 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 14:58:14,590 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 14:58:14,590 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 14:58:14,591 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 14:58:14,591 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 14:58:14,592 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 14:58:14,592 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 14:58:14,593 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 14:58:14,593 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 14:58:14,594 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 14:58:14,594 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 14:58:14,595 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 14:58:14,595 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 14:58:14,596 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 14:58:14,596 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 14:58:14,596 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 14:58:14,597 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 14:58:14,604 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 14:58:14,605 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-15 14:58:14,617 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-04-15 14:58:14,617 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 14:58:14,618 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 14:58:14,618 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-04-15 14:58:14,618 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-04-15 14:58:14,619 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 14:58:14,619 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 14:58:14,619 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 14:58:14,619 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-04-15 14:58:14,620 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-04-15 14:58:14,620 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-04-15 14:58:14,620 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 14:58:14,620 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-04-15 14:58:14,620 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-04-15 14:58:14,620 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-04-15 14:58:14,621 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 14:58:14,621 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 14:58:14,621 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 14:58:14,621 INFO  L138        SettingsManager]:  * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 14:58:14,621 INFO  L138        SettingsManager]:  * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 14:58:14,621 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 14:58:14,621 INFO  L138        SettingsManager]:  * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-15 14:58:14,621 INFO  L138        SettingsManager]:  * Use separate solver for trace checks=false
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-15 14:58:14,852 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 14:58:14,878 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 14:58:14,880 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 14:58:14,881 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-04-15 14:58:14,882 INFO  L275        PluginConnector]: CDTParser initialized
[2022-04-15 14:58:14,883 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound1.c
[2022-04-15 14:58:14,936 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7124e6f91/258d960b4bac4f43a0e5cbbd7ade35eb/FLAG12690d529
[2022-04-15 14:58:15,327 INFO  L306              CDTParser]: Found 1 translation units.
[2022-04-15 14:58:15,327 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound1.c
[2022-04-15 14:58:15,336 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7124e6f91/258d960b4bac4f43a0e5cbbd7ade35eb/FLAG12690d529
[2022-04-15 14:58:15,733 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7124e6f91/258d960b4bac4f43a0e5cbbd7ade35eb
[2022-04-15 14:58:15,735 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 14:58:15,736 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 14:58:15,739 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 14:58:15,739 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 14:58:15,742 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 14:58:15,743 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,744 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5863e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15, skipping insertion in model container
[2022-04-15 14:58:15,744 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,749 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-04-15 14:58:15,762 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-04-15 14:58:15,889 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/egcd3-ll_unwindbound1.c[490,503]
[2022-04-15 14:58:15,910 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-04-15 14:58:15,917 INFO  L203         MainTranslator]: Completed pre-run
[2022-04-15 14:58:15,926 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/egcd3-ll_unwindbound1.c[490,503]
[2022-04-15 14:58:15,942 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-04-15 14:58:15,952 INFO  L208         MainTranslator]: Completed translation
[2022-04-15 14:58:15,952 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15 WrapperNode
[2022-04-15 14:58:15,952 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 14:58:15,953 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 14:58:15,953 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 14:58:15,953 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 14:58:15,960 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,960 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,965 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,965 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,971 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,975 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,976 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,978 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 14:58:15,979 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 14:58:15,979 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 14:58:15,979 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-04-15 14:58:15,980 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (1/1) ...
[2022-04-15 14:58:15,986 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 14:58:15,993 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 14:58:16,008 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-15 14:58:16,028 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-15 14:58:16,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 14:58:16,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 14:58:16,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 14:58:16,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 14:58:16,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 14:58:16,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 14:58:16,045 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 14:58:16,046 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 14:58:16,046 INFO  L130     BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 14:58:16,046 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 14:58:16,046 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-15 14:58:16,046 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 14:58:16,046 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 14:58:16,047 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2022-04-15 14:58:16,047 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 14:58:16,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 14:58:16,049 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 14:58:16,049 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 14:58:16,049 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 14:58:16,049 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 14:58:16,123 INFO  L234             CfgBuilder]: Building ICFG
[2022-04-15 14:58:16,124 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 14:58:16,394 INFO  L275             CfgBuilder]: Performing block encoding
[2022-04-15 14:58:16,400 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 14:58:16,400 INFO  L299             CfgBuilder]: Removed 3 assume(true) statements.
[2022-04-15 14:58:16,402 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:58:16 BoogieIcfgContainer
[2022-04-15 14:58:16,402 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 14:58:16,403 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 14:58:16,403 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 14:58:16,406 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-04-15 14:58:16,406 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:58:15" (1/3) ...
[2022-04-15 14:58:16,406 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdd92d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:58:16, skipping insertion in model container
[2022-04-15 14:58:16,406 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:58:15" (2/3) ...
[2022-04-15 14:58:16,407 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdd92d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:58:16, skipping insertion in model container
[2022-04-15 14:58:16,407 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:58:16" (3/3) ...
[2022-04-15 14:58:16,408 INFO  L111   eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound1.c
[2022-04-15 14:58:16,411 INFO  L202   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 14:58:16,411 INFO  L161   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 14:58:16,454 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 14:58:16,465 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-15 14:58:16,465 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 14:58:16,485 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-15 14:58:16,491 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-15 14:58:16,491 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-15 14:58:16,492 INFO  L499         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 14:58:16,492 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 14:58:16,497 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 14:58:16,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times
[2022-04-15 14:58:16,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 14:58:16,504 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641688755]
[2022-04-15 14:58:16,514 INFO  L202   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 14:58:16,514 INFO  L85        PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 2 times
[2022-04-15 14:58:16,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 14:58:16,518 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322119706]
[2022-04-15 14:58:16,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 14:58:16,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 14:58:16,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 14:58:16,701 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 14:58:16,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 14:58:16,731 INFO  L290        TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID
[2022-04-15 14:58:16,732 INFO  L290        TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID
[2022-04-15 14:58:16,732 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID
[2022-04-15 14:58:16,733 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 14:58:16,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 14:58:16,745 INFO  L290        TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID
[2022-04-15 14:58:16,746 INFO  L290        TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID
[2022-04-15 14:58:16,746 INFO  L290        TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID
[2022-04-15 14:58:16,747 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID
[2022-04-15 14:58:16,747 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-15 14:58:16,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 14:58:16,772 INFO  L290        TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID
[2022-04-15 14:58:16,772 INFO  L290        TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID
[2022-04-15 14:58:16,773 INFO  L290        TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID
[2022-04-15 14:58:16,773 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID
[2022-04-15 14:58:16,775 INFO  L272        TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 14:58:16,776 INFO  L290        TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID
[2022-04-15 14:58:16,776 INFO  L290        TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID
[2022-04-15 14:58:16,776 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID
[2022-04-15 14:58:16,776 INFO  L272        TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID
[2022-04-15 14:58:16,777 INFO  L290        TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#true} is VALID
[2022-04-15 14:58:16,777 INFO  L272        TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID
[2022-04-15 14:58:16,777 INFO  L290        TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID
[2022-04-15 14:58:16,778 INFO  L290        TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID
[2022-04-15 14:58:16,778 INFO  L290        TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID
[2022-04-15 14:58:16,778 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID
[2022-04-15 14:58:16,779 INFO  L272        TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID
[2022-04-15 14:58:16,779 INFO  L290        TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID
[2022-04-15 14:58:16,780 INFO  L290        TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID
[2022-04-15 14:58:16,780 INFO  L290        TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID
[2022-04-15 14:58:16,780 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID
[2022-04-15 14:58:16,780 INFO  L290        TraceCheckUtils]: 16: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID
[2022-04-15 14:58:16,781 INFO  L290        TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID
[2022-04-15 14:58:16,781 INFO  L272        TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID
[2022-04-15 14:58:16,781 INFO  L290        TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID
[2022-04-15 14:58:16,781 INFO  L290        TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID
[2022-04-15 14:58:16,782 INFO  L290        TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID
[2022-04-15 14:58:16,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 14:58:16,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 14:58:16,783 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322119706]
[2022-04-15 14:58:16,783 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322119706] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 14:58:16,784 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 14:58:16,784 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 14:58:16,787 INFO  L136   FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 14:58:16,788 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641688755]
[2022-04-15 14:58:16,788 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641688755] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 14:58:16,789 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 14:58:16,789 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 14:58:16,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764083716]
[2022-04-15 14:58:16,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 14:58:16,794 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-15 14:58:16,795 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-15 14:58:16,798 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:16,826 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:16,826 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 14:58:16,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 14:58:16,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 14:58:16,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 14:58:16,851 INFO  L87              Difference]: Start difference. First operand  has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,072 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:17,072 INFO  L93              Difference]: Finished difference Result 74 states and 111 transitions.
[2022-04-15 14:58:17,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-04-15 14:58:17,073 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-15 14:58:17,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 14:58:17,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions.
[2022-04-15 14:58:17,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions.
[2022-04-15 14:58:17,118 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions.
[2022-04-15 14:58:17,231 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:17,241 INFO  L225             Difference]: With dead ends: 74
[2022-04-15 14:58:17,241 INFO  L226             Difference]: Without dead ends: 36
[2022-04-15 14:58:17,244 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 14:58:17,246 INFO  L913         BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 14:58:17,248 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 14:58:17,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2022-04-15 14:58:17,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35.
[2022-04-15 14:58:17,279 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 14:58:17,280 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand  has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,280 INFO  L74              IsIncluded]: Start isIncluded. First operand 36 states. Second operand  has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,282 INFO  L87              Difference]: Start difference. First operand 36 states. Second operand  has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:17,290 INFO  L93              Difference]: Finished difference Result 36 states and 46 transitions.
[2022-04-15 14:58:17,291 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions.
[2022-04-15 14:58:17,296 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 14:58:17,296 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 14:58:17,298 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states.
[2022-04-15 14:58:17,298 INFO  L87              Difference]: Start difference. First operand  has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states.
[2022-04-15 14:58:17,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:17,305 INFO  L93              Difference]: Finished difference Result 36 states and 46 transitions.
[2022-04-15 14:58:17,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions.
[2022-04-15 14:58:17,306 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 14:58:17,306 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 14:58:17,306 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-15 14:58:17,306 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 14:58:17,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions.
[2022-04-15 14:58:17,309 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22
[2022-04-15 14:58:17,309 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-15 14:58:17,310 INFO  L478      AbstractCegarLoop]: Abstraction has 35 states and 45 transitions.
[2022-04-15 14:58:17,310 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,310 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 45 transitions.
[2022-04-15 14:58:17,358 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:17,359 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions.
[2022-04-15 14:58:17,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-15 14:58:17,360 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-15 14:58:17,360 INFO  L499         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 14:58:17,360 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 14:58:17,360 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 14:58:17,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 14:58:17,361 INFO  L85        PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times
[2022-04-15 14:58:17,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 14:58:17,361 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335584968]
[2022-04-15 14:58:17,362 INFO  L202   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 14:58:17,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 2 times
[2022-04-15 14:58:17,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 14:58:17,363 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666962302]
[2022-04-15 14:58:17,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 14:58:17,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 14:58:17,394 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 14:58:17,395 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093858540]
[2022-04-15 14:58:17,395 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 14:58:17,397 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 14:58:17,397 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 14:58:17,400 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-15 14:58:17,401 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-15 14:58:17,453 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 14:58:17,453 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 14:58:17,455 INFO  L263         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 14:58:17,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 14:58:17,470 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 14:58:17,641 INFO  L272        TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID
[2022-04-15 14:58:17,642 INFO  L290        TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,642 INFO  L290        TraceCheckUtils]: 2: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,643 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {357#(<= ~counter~0 0)} {349#true} #108#return; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,643 INFO  L272        TraceCheckUtils]: 4: Hoare triple {357#(<= ~counter~0 0)} call #t~ret9 := main(); {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,644 INFO  L290        TraceCheckUtils]: 5: Hoare triple {357#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,644 INFO  L272        TraceCheckUtils]: 6: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,645 INFO  L290        TraceCheckUtils]: 7: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,645 INFO  L290        TraceCheckUtils]: 8: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,646 INFO  L290        TraceCheckUtils]: 9: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,646 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #94#return; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,647 INFO  L272        TraceCheckUtils]: 11: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,647 INFO  L290        TraceCheckUtils]: 12: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,648 INFO  L290        TraceCheckUtils]: 13: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,648 INFO  L290        TraceCheckUtils]: 14: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,649 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #96#return; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,652 INFO  L290        TraceCheckUtils]: 16: Hoare triple {357#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {357#(<= ~counter~0 0)} is VALID
[2022-04-15 14:58:17,653 INFO  L290        TraceCheckUtils]: 17: Hoare triple {357#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {406#(<= |main_#t~post6| 0)} is VALID
[2022-04-15 14:58:17,653 INFO  L290        TraceCheckUtils]: 18: Hoare triple {406#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {350#false} is VALID
[2022-04-15 14:58:17,653 INFO  L272        TraceCheckUtils]: 19: Hoare triple {350#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {350#false} is VALID
[2022-04-15 14:58:17,654 INFO  L290        TraceCheckUtils]: 20: Hoare triple {350#false} ~cond := #in~cond; {350#false} is VALID
[2022-04-15 14:58:17,654 INFO  L290        TraceCheckUtils]: 21: Hoare triple {350#false} assume 0 == ~cond; {350#false} is VALID
[2022-04-15 14:58:17,654 INFO  L290        TraceCheckUtils]: 22: Hoare triple {350#false} assume !false; {350#false} is VALID
[2022-04-15 14:58:17,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 14:58:17,654 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 14:58:17,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 14:58:17,655 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666962302]
[2022-04-15 14:58:17,655 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 14:58:17,655 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093858540]
[2022-04-15 14:58:17,655 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093858540] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 14:58:17,656 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 14:58:17,656 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 14:58:17,656 INFO  L136   FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 14:58:17,657 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335584968]
[2022-04-15 14:58:17,657 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335584968] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 14:58:17,657 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 14:58:17,657 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 14:58:17,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547751019]
[2022-04-15 14:58:17,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 14:58:17,658 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-15 14:58:17,658 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-15 14:58:17,658 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,675 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:17,675 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 14:58:17,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 14:58:17,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 14:58:17,676 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 14:58:17,676 INFO  L87              Difference]: Start difference. First operand 35 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:17,778 INFO  L93              Difference]: Finished difference Result 44 states and 54 transitions.
[2022-04-15 14:58:17,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2022-04-15 14:58:17,779 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-15 14:58:17,779 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 14:58:17,780 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions.
[2022-04-15 14:58:17,782 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions.
[2022-04-15 14:58:17,784 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions.
[2022-04-15 14:58:17,834 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-15 14:58:17,836 INFO  L225             Difference]: With dead ends: 44
[2022-04-15 14:58:17,836 INFO  L226             Difference]: Without dead ends: 37
[2022-04-15 14:58:17,837 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-15 14:58:17,838 INFO  L913         BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 14:58:17,838 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 14:58:17,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2022-04-15 14:58:17,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2022-04-15 14:58:17,851 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 14:58:17,852 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand  has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,852 INFO  L74              IsIncluded]: Start isIncluded. First operand 37 states. Second operand  has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,853 INFO  L87              Difference]: Start difference. First operand 37 states. Second operand  has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:17,855 INFO  L93              Difference]: Finished difference Result 37 states and 47 transitions.
[2022-04-15 14:58:17,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions.
[2022-04-15 14:58:17,856 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 14:58:17,856 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 14:58:17,856 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states.
[2022-04-15 14:58:17,856 INFO  L87              Difference]: Start difference. First operand  has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states.
[2022-04-15 14:58:17,859 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:17,859 INFO  L93              Difference]: Finished difference Result 37 states and 47 transitions.
[2022-04-15 14:58:17,859 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions.
[2022-04-15 14:58:17,859 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 14:58:17,859 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 14:58:17,860 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-15 14:58:17,860 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 14:58:17,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 14:58:17,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions.
[2022-04-15 14:58:17,862 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23
[2022-04-15 14:58:17,862 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-15 14:58:17,862 INFO  L478      AbstractCegarLoop]: Abstraction has 37 states and 47 transitions.
[2022-04-15 14:58:17,862 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 14:58:17,863 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions.
[2022-04-15 14:58:17,923 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:17,923 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions.
[2022-04-15 14:58:17,924 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-15 14:58:17,924 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-15 14:58:17,924 INFO  L499         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 14:58:17,951 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-15 14:58:18,139 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 14:58:18,140 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 14:58:18,140 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 14:58:18,140 INFO  L85        PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times
[2022-04-15 14:58:18,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 14:58:18,141 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293820293]
[2022-04-15 14:58:18,141 INFO  L202   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 14:58:18,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 2 times
[2022-04-15 14:58:18,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 14:58:18,142 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787141085]
[2022-04-15 14:58:18,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 14:58:18,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 14:58:18,167 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 14:58:18,168 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143582174]
[2022-04-15 14:58:18,168 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 14:58:18,168 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 14:58:18,168 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 14:58:18,170 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-15 14:58:18,172 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-15 14:58:18,212 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 14:58:18,212 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 14:58:18,213 INFO  L263         TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core
[2022-04-15 14:58:18,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 14:58:18,230 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 14:58:18,430 INFO  L272        TraceCheckUtils]: 0: Hoare triple {657#true} call ULTIMATE.init(); {657#true} is VALID
[2022-04-15 14:58:18,430 INFO  L290        TraceCheckUtils]: 1: Hoare triple {657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {657#true} is VALID
[2022-04-15 14:58:18,430 INFO  L290        TraceCheckUtils]: 2: Hoare triple {657#true} assume true; {657#true} is VALID
[2022-04-15 14:58:18,430 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {657#true} {657#true} #108#return; {657#true} is VALID
[2022-04-15 14:58:18,430 INFO  L272        TraceCheckUtils]: 4: Hoare triple {657#true} call #t~ret9 := main(); {657#true} is VALID
[2022-04-15 14:58:18,431 INFO  L290        TraceCheckUtils]: 5: Hoare triple {657#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {657#true} is VALID
[2022-04-15 14:58:18,431 INFO  L272        TraceCheckUtils]: 6: Hoare triple {657#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {657#true} is VALID
[2022-04-15 14:58:18,431 INFO  L290        TraceCheckUtils]: 7: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID
[2022-04-15 14:58:18,431 INFO  L290        TraceCheckUtils]: 8: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID
[2022-04-15 14:58:18,431 INFO  L290        TraceCheckUtils]: 9: Hoare triple {657#true} assume true; {657#true} is VALID
[2022-04-15 14:58:18,431 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {657#true} {657#true} #94#return; {657#true} is VALID
[2022-04-15 14:58:18,431 INFO  L272        TraceCheckUtils]: 11: Hoare triple {657#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {657#true} is VALID
[2022-04-15 14:58:18,432 INFO  L290        TraceCheckUtils]: 12: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID
[2022-04-15 14:58:18,432 INFO  L290        TraceCheckUtils]: 13: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID
[2022-04-15 14:58:18,432 INFO  L290        TraceCheckUtils]: 14: Hoare triple {657#true} assume true; {657#true} is VALID
[2022-04-15 14:58:18,432 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {657#true} {657#true} #96#return; {657#true} is VALID
[2022-04-15 14:58:18,433 INFO  L290        TraceCheckUtils]: 16: Hoare triple {657#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID
[2022-04-15 14:58:18,433 INFO  L290        TraceCheckUtils]: 17: Hoare triple {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID
[2022-04-15 14:58:18,434 INFO  L290        TraceCheckUtils]: 18: Hoare triple {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 1);havoc #t~post6; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID
[2022-04-15 14:58:18,434 INFO  L290        TraceCheckUtils]: 19: Hoare triple {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 != ~b~0); {720#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID
[2022-04-15 14:58:18,435 INFO  L272        TraceCheckUtils]: 20: Hoare triple {720#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 14:58:18,436 INFO  L290        TraceCheckUtils]: 21: Hoare triple {724#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {728#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 14:58:18,436 INFO  L290        TraceCheckUtils]: 22: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {658#false} is VALID
[2022-04-15 14:58:18,436 INFO  L290        TraceCheckUtils]: 23: Hoare triple {658#false} assume !false; {658#false} is VALID
[2022-04-15 14:58:18,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 14:58:18,437 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 14:58:18,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 14:58:18,437 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787141085]
[2022-04-15 14:58:18,437 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 14:58:18,437 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143582174]
[2022-04-15 14:58:18,438 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143582174] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 14:58:18,438 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 14:58:18,438 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 14:58:18,438 INFO  L136   FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 14:58:18,438 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293820293]
[2022-04-15 14:58:18,438 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293820293] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 14:58:18,438 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 14:58:18,438 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 14:58:18,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88144089]
[2022-04-15 14:58:18,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 14:58:18,439 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24
[2022-04-15 14:58:18,439 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-15 14:58:18,440 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 14:58:18,456 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:18,457 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 14:58:18,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 14:58:18,457 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 14:58:18,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-15 14:58:18,458 INFO  L87              Difference]: Start difference. First operand 37 states and 47 transitions. Second operand  has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 14:58:18,814 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:18,814 INFO  L93              Difference]: Finished difference Result 57 states and 75 transitions.
[2022-04-15 14:58:18,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-04-15 14:58:18,814 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24
[2022-04-15 14:58:18,814 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 14:58:18,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 14:58:18,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-15 14:58:18,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 14:58:18,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions.
[2022-04-15 14:58:18,819 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions.
[2022-04-15 14:58:18,881 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:18,883 INFO  L225             Difference]: With dead ends: 57
[2022-04-15 14:58:18,883 INFO  L226             Difference]: Without dead ends: 54
[2022-04-15 14:58:18,884 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2022-04-15 14:58:18,885 INFO  L913         BasicCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 14:58:18,886 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 169 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 14:58:18,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2022-04-15 14:58:18,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53.
[2022-04-15 14:58:18,903 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 14:58:18,904 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand  has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-15 14:58:18,904 INFO  L74              IsIncluded]: Start isIncluded. First operand 54 states. Second operand  has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-15 14:58:18,904 INFO  L87              Difference]: Start difference. First operand 54 states. Second operand  has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-15 14:58:18,907 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:18,907 INFO  L93              Difference]: Finished difference Result 54 states and 71 transitions.
[2022-04-15 14:58:18,908 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions.
[2022-04-15 14:58:18,908 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 14:58:18,908 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 14:58:18,909 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states.
[2022-04-15 14:58:18,909 INFO  L87              Difference]: Start difference. First operand  has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states.
[2022-04-15 14:58:18,912 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 14:58:18,912 INFO  L93              Difference]: Finished difference Result 54 states and 71 transitions.
[2022-04-15 14:58:18,912 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions.
[2022-04-15 14:58:18,913 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 14:58:18,913 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 14:58:18,913 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-15 14:58:18,913 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 14:58:18,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-15 14:58:18,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions.
[2022-04-15 14:58:18,916 INFO  L78                 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 24
[2022-04-15 14:58:18,916 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-15 14:58:18,916 INFO  L478      AbstractCegarLoop]: Abstraction has 53 states and 70 transitions.
[2022-04-15 14:58:18,917 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 14:58:18,917 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 70 transitions.
[2022-04-15 14:58:18,979 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-15 14:58:18,980 INFO  L276                IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions.
[2022-04-15 14:58:18,980 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-15 14:58:18,980 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-15 14:58:18,980 INFO  L499         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 14:58:19,006 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-15 14:58:19,195 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-15 14:58:19,196 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 14:58:19,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 14:58:19,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times
[2022-04-15 14:58:19,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 14:58:19,196 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1925565906]
[2022-04-15 14:58:19,197 INFO  L202   tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 14:58:19,197 INFO  L85        PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 2 times
[2022-04-15 14:58:19,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 14:58:19,197 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148911514]
[2022-04-15 14:58:19,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 14:58:19,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 14:58:19,216 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 14:58:19,217 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243102702]
[2022-04-15 14:58:19,217 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 14:58:19,217 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 14:58:19,217 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 14:58:19,218 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-15 14:58:19,221 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-15 14:58:19,264 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 14:58:19,265 INFO  L229   tOrderPrioritization]: Conjunction of SSA is sat
[2022-04-15 14:58:19,265 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-15 14:58:19,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-15 14:58:19,295 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-15 14:58:19,295 INFO  L130   FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace
[2022-04-15 14:58:19,296 INFO  L618         BasicCegarLoop]: Counterexample is feasible
[2022-04-15 14:58:19,297 INFO  L788   garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-15 14:58:19,324 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-15 14:58:19,527 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 14:58:19,530 INFO  L719         BasicCegarLoop]: Path program histogram: [2, 2, 2, 2]
[2022-04-15 14:58:19,532 INFO  L177   ceAbstractionStarter]: Computing trace abstraction results
[2022-04-15 14:58:19,542 WARN  L170   areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: L8 has no Hoare annotation
[2022-04-15 14:58:19,543 WARN  L170   areAnnotationChecker]: L8 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L24 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L24 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L8-2 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L24-1 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L24-1 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: L11-2 has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-15 14:58:19,544 WARN  L170   areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L25 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L34-3 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L34-3 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L49-1 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L49-1 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L50 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L50 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L51 has no Hoare annotation
[2022-04-15 14:58:19,545 WARN  L170   areAnnotationChecker]: L51 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L52 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L52 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L73 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L34-4 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L34-4 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L48-4 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L48-3 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L48-3 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L35 has no Hoare annotation
[2022-04-15 14:58:19,546 WARN  L170   areAnnotationChecker]: L35 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L41-3 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L41-3 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L48-1 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L48-1 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L41-4 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L41-1 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L41-1 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L49 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L49 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L42 has no Hoare annotation
[2022-04-15 14:58:19,547 WARN  L170   areAnnotationChecker]: L42 has no Hoare annotation
[2022-04-15 14:58:19,547 INFO  L163   areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-15 14:58:19,549 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:58:19 BoogieIcfgContainer
[2022-04-15 14:58:19,549 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-15 14:58:19,550 INFO  L158              Benchmark]: Toolchain (without parser) took 3813.92ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 138.9MB in the beginning and 167.9MB in the end (delta: -29.0MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB.
[2022-04-15 14:58:19,550 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 14:58:19,551 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 213.85ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 162.3MB in the end (delta: -23.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-15 14:58:19,551 INFO  L158              Benchmark]: Boogie Preprocessor took 25.27ms. Allocated memory is still 184.5MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-15 14:58:19,552 INFO  L158              Benchmark]: RCFGBuilder took 423.19ms. Allocated memory is still 184.5MB. Free memory was 160.7MB in the beginning and 147.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2022-04-15 14:58:19,552 INFO  L158              Benchmark]: TraceAbstraction took 3145.86ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 147.1MB in the beginning and 167.9MB in the end (delta: -20.8MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB.
[2022-04-15 14:58:19,554 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.14ms. Allocated memory is still 184.5MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 213.85ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 162.3MB in the end (delta: -23.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 25.27ms. Allocated memory is still 184.5MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 423.19ms. Allocated memory is still 184.5MB. Free memory was 160.7MB in the beginning and 147.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
 * TraceAbstraction took 3145.86ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 147.1MB in the beginning and 167.9MB in the end (delta: -20.8MB). Peak memory consumption was 25.3MB. 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;
[L20]              int x, y;
[L21]              long long a, b, p, q, r, s;
[L22]              x = __VERIFIER_nondet_int()
[L23]              y = __VERIFIER_nondet_int()
[L24]  CALL        assume_abort_if_not(x >= 1)
[L8]   COND FALSE  !(!cond)
[L24]  RET         assume_abort_if_not(x >= 1)
[L25]  CALL        assume_abort_if_not(y >= 1)
[L8]   COND FALSE  !(!cond)
[L25]  RET         assume_abort_if_not(y >= 1)
[L27]              a = x
[L28]              b = y
[L29]              p = 1
[L30]              q = 0
[L31]              r = 0
[L32]              s = 1
[L34]  EXPR        counter++
[L34]  COND TRUE   counter++<1
[L35]  COND FALSE  !(!(b != 0))
[L37]              long long c, k;
[L38]              c = a
[L39]              k = 0
[L41]  EXPR        counter++
[L41]  COND FALSE  !(counter++<1)
[L63]              a = b
[L64]              b = c
[L65]              long long temp;
[L66]              temp = p
[L67]              p = q
[L68]              q = temp - q * k
[L69]              temp = r
[L70]              r = s
[L71]              s = temp - s * k
[L34]  EXPR        counter++
[L34]  COND FALSE  !(counter++<1)
[L73]  CALL        __VERIFIER_assert(p*x - q*x + r*y - s*y  == a)
[L11]  COND TRUE   !(cond)
[L13]              reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 130 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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-15 14:58:19,585 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...