/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/ps5-ll_unwindbound1.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 14:20:27,163 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 14:20:27,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 14:20:27,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 14:20:27,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 14:20:27,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 14:20:27,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 14:20:27,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 14:20:27,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 14:20:27,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 14:20:27,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 14:20:27,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 14:20:27,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 14:20:27,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 14:20:27,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 14:20:27,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 14:20:27,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 14:20:27,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 14:20:27,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 14:20:27,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 14:20:27,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 14:20:27,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 14:20:27,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 14:20:27,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 14:20:27,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 14:20:27,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 14:20:27,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 14:20:27,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 14:20:27,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 14:20:27,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 14:20:27,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 14:20:27,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 14:20:27,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 14:20:27,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 14:20:27,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 14:20:27,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 14:20:27,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 14:20:27,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 14:20:27,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 14:20:27,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 14:20:27,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 14:20:27,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 14:20:27,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-08 14:20:27,235 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 14:20:27,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 14:20:27,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 14:20:27,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 14:20:27,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 14:20:27,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 14:20:27,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 14:20:27,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 14:20:27,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 14:20:27,237 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 14:20:27,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 14:20:27,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 14:20:27,238 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 14:20:27,239 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-08 14:20:27,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 14:20:27,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 14:20:27,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 14:20:27,402 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 14:20:27,403 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 14:20:27,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound1.c
[2022-04-08 14:20:27,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1ca4fb2/9b4d39c7ccd4463f9ca0b3869a0aa112/FLAG055aceb24
[2022-04-08 14:20:27,791 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 14:20:27,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound1.c
[2022-04-08 14:20:27,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1ca4fb2/9b4d39c7ccd4463f9ca0b3869a0aa112/FLAG055aceb24
[2022-04-08 14:20:27,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1ca4fb2/9b4d39c7ccd4463f9ca0b3869a0aa112
[2022-04-08 14:20:27,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 14:20:27,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 14:20:27,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 14:20:27,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 14:20:27,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 14:20:27,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:20:27" (1/1) ...
[2022-04-08 14:20:27,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22fcdc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:27, skipping insertion in model container
[2022-04-08 14:20:27,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:20:27" (1/1) ...
[2022-04-08 14:20:27,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 14:20:27,836 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 14:20:27,981 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/ps5-ll_unwindbound1.c[458,471]
[2022-04-08 14:20:28,007 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 14:20:28,013 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 14:20:28,021 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/ps5-ll_unwindbound1.c[458,471]
[2022-04-08 14:20:28,036 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 14:20:28,044 INFO L208 MainTranslator]: Completed translation
[2022-04-08 14:20:28,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28 WrapperNode
[2022-04-08 14:20:28,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 14:20:28,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 14:20:28,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 14:20:28,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 14:20:28,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 14:20:28,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 14:20:28,079 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 14:20:28,079 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 14:20:28,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (1/1) ...
[2022-04-08 14:20:28,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 14:20:28,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 14:20:28,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 14:20:28,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 14:20:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 14:20:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 14:20:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 14:20:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 14:20:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 14:20:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 14:20:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 14:20:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 14:20:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 14:20:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 14:20:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short
[2022-04-08 14:20:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 14:20:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 14:20:28,142 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 14:20:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 14:20:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 14:20:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 14:20:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 14:20:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 14:20:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 14:20:28,187 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 14:20:28,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 14:20:28,331 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 14:20:28,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 14:20:28,336 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 14:20:28,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:20:28 BoogieIcfgContainer
[2022-04-08 14:20:28,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 14:20:28,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 14:20:28,339 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 14:20:28,363 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 14:20:28,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:20:27" (1/3) ...
[2022-04-08 14:20:28,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b08b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:20:28, skipping insertion in model container
[2022-04-08 14:20:28,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:20:28" (2/3) ...
[2022-04-08 14:20:28,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b08b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:20:28, skipping insertion in model container
[2022-04-08 14:20:28,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:20:28" (3/3) ...
[2022-04-08 14:20:28,365 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound1.c
[2022-04-08 14:20:28,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 14:20:28,368 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 14:20:28,403 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 14:20:28,407 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-08 14:20:28,407 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 14:20:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 14:20:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 14:20:28,425 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:20:28,425 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:20:28,426 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:20:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:20:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times
[2022-04-08 14:20:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:28,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074812163]
[2022-04-08 14:20:28,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:20:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times
[2022-04-08 14:20:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:20:28,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856572557]
[2022-04-08 14:20:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:20:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:20:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:20:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 14:20:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:20:28,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID
[2022-04-08 14:20:28,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID
[2022-04-08 14:20:28,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID
[2022-04-08 14:20:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 14:20:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:20:28,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID
[2022-04-08 14:20:28,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID
[2022-04-08 14:20:28,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID
[2022-04-08 14:20:28,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID
[2022-04-08 14:20:28,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 14:20:28,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID
[2022-04-08 14:20:28,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID
[2022-04-08 14:20:28,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID
[2022-04-08 14:20:28,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID
[2022-04-08 14:20:28,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID
[2022-04-08 14:20:28,619 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID
[2022-04-08 14:20:28,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID
[2022-04-08 14:20:28,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID
[2022-04-08 14:20:28,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID
[2022-04-08 14:20:28,621 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID
[2022-04-08 14:20:28,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID
[2022-04-08 14:20:28,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID
[2022-04-08 14:20:28,621 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID
[2022-04-08 14:20:28,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID
[2022-04-08 14:20:28,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID
[2022-04-08 14:20:28,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID
[2022-04-08 14:20:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:20:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:20:28,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856572557]
[2022-04-08 14:20:28,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856572557] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:20:28,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:20:28,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 14:20:28,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:20:28,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074812163]
[2022-04-08 14:20:28,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074812163] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:20:28,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:20:28,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 14:20:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51853202]
[2022-04-08 14:20:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:20:28,629 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 14:20:28,630 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:20:28,635 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:28,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:28,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 14:20:28,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 14:20:28,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 14:20:28,682 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:28,818 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions.
[2022-04-08 14:20:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 14:20:28,818 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 14:20:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:20:28,819 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions.
[2022-04-08 14:20:28,830 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions.
[2022-04-08 14:20:28,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions.
[2022-04-08 14:20:28,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:28,936 INFO L225 Difference]: With dead ends: 50
[2022-04-08 14:20:28,936 INFO L226 Difference]: Without dead ends: 25
[2022-04-08 14:20:28,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 14:20:28,940 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:20:28,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:20:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2022-04-08 14:20:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24.
[2022-04-08 14:20:28,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:20:28,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:28,964 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:28,965 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:28,974 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions.
[2022-04-08 14:20:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions.
[2022-04-08 14:20:28,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:28,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:28,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states.
[2022-04-08 14:20:28,976 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states.
[2022-04-08 14:20:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:28,979 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions.
[2022-04-08 14:20:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions.
[2022-04-08 14:20:28,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:28,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:28,983 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:20:28,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:20:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions.
[2022-04-08 14:20:28,988 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17
[2022-04-08 14:20:28,988 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:20:28,988 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions.
[2022-04-08 14:20:28,988 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:28,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions.
[2022-04-08 14:20:29,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions.
[2022-04-08 14:20:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-08 14:20:29,014 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:20:29,014 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:20:29,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 14:20:29,014 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:20:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:20:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times
[2022-04-08 14:20:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:29,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480364565]
[2022-04-08 14:20:29,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:20:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times
[2022-04-08 14:20:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:20:29,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559159993]
[2022-04-08 14:20:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:20:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:20:29,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 14:20:29,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564016860]
[2022-04-08 14:20:29,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 14:20:29,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 14:20:29,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 14:20:29,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 14:20:29,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-08 14:20:29,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 14:20:29,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 14:20:29,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-08 14:20:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:20:29,105 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 14:20:29,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID
[2022-04-08 14:20:29,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID
[2022-04-08 14:20:29,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID
[2022-04-08 14:20:29,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {243#false} is VALID
[2022-04-08 14:20:29,243 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {243#false} is VALID
[2022-04-08 14:20:29,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID
[2022-04-08 14:20:29,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID
[2022-04-08 14:20:29,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID
[2022-04-08 14:20:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:20:29,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 14:20:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:20:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559159993]
[2022-04-08 14:20:29,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 14:20:29,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564016860]
[2022-04-08 14:20:29,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564016860] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:20:29,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:20:29,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:20:29,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:20:29,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480364565]
[2022-04-08 14:20:29,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480364565] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:20:29,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:20:29,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 14:20:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769843191]
[2022-04-08 14:20:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:20:29,249 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18
[2022-04-08 14:20:29,249 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:20:29,250 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 14:20:29,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:29,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 14:20:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 14:20:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 14:20:29,267 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 14:20:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:29,320 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions.
[2022-04-08 14:20:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 14:20:29,320 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18
[2022-04-08 14:20:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:20:29,320 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 14:20:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions.
[2022-04-08 14:20:29,323 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 14:20:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions.
[2022-04-08 14:20:29,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions.
[2022-04-08 14:20:29,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:29,352 INFO L225 Difference]: With dead ends: 34
[2022-04-08 14:20:29,352 INFO L226 Difference]: Without dead ends: 26
[2022-04-08 14:20:29,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-08 14:20:29,355 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:20:29,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:20:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-08 14:20:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2022-04-08 14:20:29,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:20:29,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:29,373 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:29,374 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:29,375 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-08 14:20:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 14:20:29,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:29,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:29,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states.
[2022-04-08 14:20:29,376 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states.
[2022-04-08 14:20:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:29,377 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-08 14:20:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 14:20:29,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:29,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:29,378 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:20:29,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:20:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 14:20:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions.
[2022-04-08 14:20:29,379 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18
[2022-04-08 14:20:29,379 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:20:29,380 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions.
[2022-04-08 14:20:29,380 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 14:20:29,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions.
[2022-04-08 14:20:29,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 14:20:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-08 14:20:29,408 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:20:29,408 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:20:29,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-08 14:20:29,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 14:20:29,627 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:20:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:20:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times
[2022-04-08 14:20:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674164625]
[2022-04-08 14:20:29,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 14:20:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times
[2022-04-08 14:20:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:20:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546891355]
[2022-04-08 14:20:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:20:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:20:29,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 14:20:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471385456]
[2022-04-08 14:20:29,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 14:20:29,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 14:20:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 14:20:29,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 14:20:29,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-08 14:20:29,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 14:20:29,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 14:20:29,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 14:20:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:20:29,681 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 14:20:29,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID
[2022-04-08 14:20:29,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID
[2022-04-08 14:20:29,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID
[2022-04-08 14:20:29,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID
[2022-04-08 14:20:29,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID
[2022-04-08 14:20:29,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {471#true} is VALID
[2022-04-08 14:20:29,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID
[2022-04-08 14:20:29,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID
[2022-04-08 14:20:29,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID
[2022-04-08 14:20:29,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID
[2022-04-08 14:20:29,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID
[2022-04-08 14:20:29,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 14:20:29,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 14:20:29,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 14:20:29,793 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 14:20:29,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 14:20:29,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID
[2022-04-08 14:20:29,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID
[2022-04-08 14:20:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:20:29,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 14:20:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:20:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546891355]
[2022-04-08 14:20:29,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 14:20:29,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471385456]
[2022-04-08 14:20:29,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471385456] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:20:29,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:20:29,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 14:20:29,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:20:29,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [674164625]
[2022-04-08 14:20:29,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [674164625] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:20:29,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:20:29,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 14:20:29,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624948288]
[2022-04-08 14:20:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:20:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18
[2022-04-08 14:20:29,796 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:20:29,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:29,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:29,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 14:20:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:29,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 14:20:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 14:20:29,811 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:29,969 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions.
[2022-04-08 14:20:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 14:20:29,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18
[2022-04-08 14:20:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:20:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions.
[2022-04-08 14:20:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions.
[2022-04-08 14:20:29,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions.
[2022-04-08 14:20:30,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:30,004 INFO L225 Difference]: With dead ends: 36
[2022-04-08 14:20:30,004 INFO L226 Difference]: Without dead ends: 32
[2022-04-08 14:20:30,004 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-08 14:20:30,005 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:20:30,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:20:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2022-04-08 14:20:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2022-04-08 14:20:30,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:20:30,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:30,019 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:30,019 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:30,020 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions.
[2022-04-08 14:20:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2022-04-08 14:20:30,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:30,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:30,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states.
[2022-04-08 14:20:30,021 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states.
[2022-04-08 14:20:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:30,022 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions.
[2022-04-08 14:20:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2022-04-08 14:20:30,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:30,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:30,023 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:20:30,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:20:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions.
[2022-04-08 14:20:30,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18
[2022-04-08 14:20:30,024 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:20:30,024 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions.
[2022-04-08 14:20:30,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 14:20:30,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions.
[2022-04-08 14:20:30,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2022-04-08 14:20:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 14:20:30,050 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:20:30,050 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:20:30,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 14:20:30,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-08 14:20:30,263 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:20:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:20:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times
[2022-04-08 14:20:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:30,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230556134]
[2022-04-08 14:20:30,415 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 14:20:30,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 14:20:30,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times
[2022-04-08 14:20:30,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:20:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351241954]
[2022-04-08 14:20:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:20:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:20:30,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 14:20:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706363387]
[2022-04-08 14:20:30,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 14:20:30,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 14:20:30,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 14:20:30,427 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-08 14:20:30,428 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-08 14:20:30,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 14:20:30,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 14:20:30,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-08 14:20:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 14:20:30,542 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 14:20:30,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {731#true} assume true; {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {731#true} {731#true} #61#return; {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {731#true} call #t~ret6 := main(); {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {731#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {731#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID
[2022-04-08 14:20:30,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID
[2022-04-08 14:20:30,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {731#true} #53#return; {731#true} is VALID
[2022-04-08 14:20:30,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {731#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {769#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 14:20:30,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {769#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {769#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 14:20:30,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {769#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {769#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 14:20:30,672 INFO L272 TraceCheckUtils]: 14: Hoare triple {769#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {731#true} is VALID
[2022-04-08 14:20:30,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID
[2022-04-08 14:20:30,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID
[2022-04-08 14:20:30,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID
[2022-04-08 14:20:30,673 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {769#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {769#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 14:20:30,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {769#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {794#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} is VALID
[2022-04-08 14:20:30,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {794#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {794#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} is VALID
[2022-04-08 14:20:30,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {794#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} assume !(#t~post5 < 1);havoc #t~post5; {794#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} is VALID
[2022-04-08 14:20:30,675 INFO L272 TraceCheckUtils]: 22: Hoare triple {794#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 14:20:30,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {808#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 14:20:30,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {732#false} is VALID
[2022-04-08 14:20:30,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID
[2022-04-08 14:20:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 14:20:30,676 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 14:20:30,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID
[2022-04-08 14:20:30,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {732#false} is VALID
[2022-04-08 14:20:30,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {808#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 14:20:30,809 INFO L272 TraceCheckUtils]: 22: Hoare triple {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 14:20:30,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !(#t~post5 < 1);havoc #t~post5; {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID
[2022-04-08 14:20:30,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID
[2022-04-08 14:20:32,829 WARN L290 TraceCheckUtils]: 19: Hoare triple {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN
[2022-04-08 14:20:32,839 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #55#return; {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID
[2022-04-08 14:20:32,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID
[2022-04-08 14:20:32,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID
[2022-04-08 14:20:32,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID
[2022-04-08 14:20:32,839 INFO L272 TraceCheckUtils]: 14: Hoare triple {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {731#true} is VALID
[2022-04-08 14:20:32,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 1);havoc #t~post5; {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID
[2022-04-08 14:20:32,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID
[2022-04-08 14:20:32,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {731#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {824#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID
[2022-04-08 14:20:32,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {731#true} #53#return; {731#true} is VALID
[2022-04-08 14:20:32,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID
[2022-04-08 14:20:32,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID
[2022-04-08 14:20:32,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID
[2022-04-08 14:20:32,843 INFO L272 TraceCheckUtils]: 6: Hoare triple {731#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID
[2022-04-08 14:20:32,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {731#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {731#true} is VALID
[2022-04-08 14:20:32,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {731#true} call #t~ret6 := main(); {731#true} is VALID
[2022-04-08 14:20:32,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {731#true} {731#true} #61#return; {731#true} is VALID
[2022-04-08 14:20:32,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {731#true} assume true; {731#true} is VALID
[2022-04-08 14:20:32,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {731#true} is VALID
[2022-04-08 14:20:32,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID
[2022-04-08 14:20:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-04-08 14:20:32,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 14:20:32,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351241954]
[2022-04-08 14:20:32,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 14:20:32,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706363387]
[2022-04-08 14:20:32,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706363387] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-08 14:20:32,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-08 14:20:32,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7
[2022-04-08 14:20:32,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 14:20:32,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230556134]
[2022-04-08 14:20:32,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230556134] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 14:20:32,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 14:20:32,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 14:20:32,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130466207]
[2022-04-08 14:20:32,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 14:20:32,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26
[2022-04-08 14:20:32,846 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 14:20:32,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 14:20:34,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:34,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 14:20:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 14:20:34,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-08 14:20:34,887 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 14:20:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:35,054 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions.
[2022-04-08 14:20:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 14:20:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26
[2022-04-08 14:20:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 14:20:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 14:20:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions.
[2022-04-08 14:20:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 14:20:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions.
[2022-04-08 14:20:35,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions.
[2022-04-08 14:20:35,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:35,421 INFO L225 Difference]: With dead ends: 38
[2022-04-08 14:20:35,421 INFO L226 Difference]: Without dead ends: 34
[2022-04-08 14:20:35,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2022-04-08 14:20:35,422 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 14:20:35,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 14:20:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2022-04-08 14:20:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2022-04-08 14:20:35,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 14:20:35,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:35,441 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:35,441 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:35,442 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions.
[2022-04-08 14:20:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions.
[2022-04-08 14:20:35,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:35,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:35,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states.
[2022-04-08 14:20:35,443 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states.
[2022-04-08 14:20:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 14:20:35,444 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions.
[2022-04-08 14:20:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions.
[2022-04-08 14:20:35,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 14:20:35,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 14:20:35,444 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 14:20:35,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 14:20:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 14:20:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions.
[2022-04-08 14:20:35,445 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26
[2022-04-08 14:20:35,445 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 14:20:35,446 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions.
[2022-04-08 14:20:35,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 14:20:35,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 36 transitions.
[2022-04-08 14:20:35,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 14:20:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions.
[2022-04-08 14:20:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2022-04-08 14:20:35,711 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 14:20:35,711 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 14:20:35,727 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-08 14:20:35,911 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-08 14:20:35,912 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 14:20:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 14:20:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1589507521, now seen corresponding path program 1 times
[2022-04-08 14:20:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 14:20:35,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119219550]
[2022-04-08 14:20:36,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 14:20:36,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 14:20:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1589507521, now seen corresponding path program 2 times
[2022-04-08 14:20:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 14:20:36,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664225618]
[2022-04-08 14:20:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 14:20:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 14:20:36,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 14:20:36,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [900397010]
[2022-04-08 14:20:36,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 14:20:36,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 14:20:36,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 14:20:36,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 14:20:36,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-08 14:20:36,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 14:20:36,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2022-04-08 14:20:36,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-08 14:20:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-08 14:20:36,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-08 14:20:36,118 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace
[2022-04-08 14:20:36,118 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-08 14:20:36,120 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 14:20:36,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-04-08 14:20:36,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 14:20:36,340 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2]
[2022-04-08 14:20:36,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation
[2022-04-08 14:20:36,349 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-08 14:20:36,350 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-08 14:20:36,350 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-08 14:20:36,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:20:36 BoogieIcfgContainer
[2022-04-08 14:20:36,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 14:20:36,352 INFO L158 Benchmark]: Toolchain (without parser) took 8540.09ms. Allocated memory was 185.6MB in the beginning and 243.3MB in the end (delta: 57.7MB). Free memory was 131.3MB in the beginning and 186.1MB in the end (delta: -54.8MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB.
[2022-04-08 14:20:36,352 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 14:20:36,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.53ms. Allocated memory is still 185.6MB. Free memory was 131.0MB in the beginning and 154.8MB in the end (delta: -23.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB.
[2022-04-08 14:20:36,352 INFO L158 Benchmark]: Boogie Preprocessor took 32.54ms. Allocated memory is still 185.6MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 14:20:36,353 INFO L158 Benchmark]: RCFGBuilder took 258.86ms. Allocated memory is still 185.6MB. Free memory was 153.2MB in the beginning and 142.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-08 14:20:36,353 INFO L158 Benchmark]: TraceAbstraction took 8012.69ms. Allocated memory was 185.6MB in the beginning and 243.3MB in the end (delta: 57.7MB). Free memory was 141.7MB in the beginning and 186.1MB in the end (delta: -44.4MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB.
[2022-04-08 14:20:36,354 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 231.53ms. Allocated memory is still 185.6MB. Free memory was 131.0MB in the beginning and 154.8MB in the end (delta: -23.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 32.54ms. Allocated memory is still 185.6MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 258.86ms. Allocated memory is still 185.6MB. Free memory was 153.2MB in the beginning and 142.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 8012.69ms. Allocated memory was 185.6MB in the beginning and 243.3MB in the end (delta: 57.7MB). Free memory was 141.7MB in the beginning and 186.1MB in the end (delta: -44.4MB). Peak memory consumption was 13.8MB. 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: 12]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L17] int counter = 0;
[L19] short k;
[L20] long long y, x, c;
[L21] k = __VERIFIER_nondet_short()
[L22] CALL assume_abort_if_not(k <= 256)
[L7] COND FALSE !(!cond)
[L22] RET assume_abort_if_not(k <= 256)
[L24] y = 0
[L25] x = 0
[L26] c = 0
[L28] EXPR counter++
[L28] COND TRUE counter++<1
[L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0)
[L10] COND FALSE !(!(cond))
[L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0)
[L31] COND FALSE !(!(c < k))
[L34] c = c + 1
[L35] y = y + 1
[L36] x = y * y * y * y + x
[L28] EXPR counter++
[L28] COND FALSE !(counter++<1)
[L39] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0)
[L10] COND FALSE !(!(cond))
[L39] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0)
[L40] CALL __VERIFIER_assert(k*y == y*y)
[L10] COND TRUE !(cond)
[L12] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 102 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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-08 14:20:36,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...