/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/ps2-ll_unwindbound100.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 16:28:44,890 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 16:28:44,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 16:28:44,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 16:28:44,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 16:28:44,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 16:28:44,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 16:28:44,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 16:28:44,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 16:28:44,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 16:28:44,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 16:28:44,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 16:28:44,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 16:28:44,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 16:28:44,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 16:28:44,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 16:28:44,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 16:28:44,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 16:28:44,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 16:28:44,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 16:28:44,930 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 16:28:44,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 16:28:44,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 16:28:44,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 16:28:44,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 16:28:44,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 16:28:44,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 16:28:44,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 16:28:44,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 16:28:44,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 16:28:44,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 16:28:44,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 16:28:44,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 16:28:44,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 16:28:44,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 16:28:44,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 16:28:44,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 16:28:44,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 16:28:44,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 16:28:44,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 16:28:44,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 16:28:44,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 16:28:44,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-15 16:28:44,952 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 16:28:44,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 16:28:44,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 16:28:44,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 16:28:44,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 16:28:44,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 16:28:44,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 16:28:44,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 16:28:44,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 16:28:44,956 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 16:28:44,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 16:28:44,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 16:28:44,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 16:28:44,957 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 16:28:44,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 16:28:44,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 16:28:44,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 16:28:44,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 16:28:44,957 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 16:28:44,958 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 16:28:44,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 16:28:44,958 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-15 16:28:44,958 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-15 16:28:45,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 16:28:45,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 16:28:45,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 16:28:45,208 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 16:28:45,208 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 16:28:45,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound100.c
[2022-04-15 16:28:45,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2226b39ac/72ae33713b764f7c81acfe0fcd2c437b/FLAG85745a7ff
[2022-04-15 16:28:45,685 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 16:28:45,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound100.c
[2022-04-15 16:28:45,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2226b39ac/72ae33713b764f7c81acfe0fcd2c437b/FLAG85745a7ff
[2022-04-15 16:28:46,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2226b39ac/72ae33713b764f7c81acfe0fcd2c437b
[2022-04-15 16:28:46,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 16:28:46,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 16:28:46,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 16:28:46,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 16:28:46,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 16:28:46,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db76073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46, skipping insertion in model container
[2022-04-15 16:28:46,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 16:28:46,120 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 16:28:46,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound100.c[454,467]
[2022-04-15 16:28:46,262 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 16:28:46,269 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 16:28:46,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound100.c[454,467]
[2022-04-15 16:28:46,285 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 16:28:46,295 INFO L208 MainTranslator]: Completed translation
[2022-04-15 16:28:46,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46 WrapperNode
[2022-04-15 16:28:46,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 16:28:46,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 16:28:46,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 16:28:46,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 16:28:46,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 16:28:46,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 16:28:46,320 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 16:28:46,320 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 16:28:46,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (1/1) ...
[2022-04-15 16:28:46,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 16:28:46,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:28:46,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-15 16:28:46,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-15 16:28:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 16:28:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 16:28:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 16:28:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 16:28:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 16:28:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 16:28:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 16:28:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 16:28:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 16:28:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 16:28:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 16:28:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 16:28:46,430 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 16:28:46,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 16:28:46,521 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 16:28:46,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 16:28:46,527 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 16:28:46,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:28:46 BoogieIcfgContainer
[2022-04-15 16:28:46,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 16:28:46,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 16:28:46,530 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 16:28:46,533 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 16:28:46,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:28:46" (1/3) ...
[2022-04-15 16:28:46,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5927a961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:28:46, skipping insertion in model container
[2022-04-15 16:28:46,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:28:46" (2/3) ...
[2022-04-15 16:28:46,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5927a961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:28:46, skipping insertion in model container
[2022-04-15 16:28:46,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:28:46" (3/3) ...
[2022-04-15 16:28:46,535 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_unwindbound100.c
[2022-04-15 16:28:46,538 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 16:28:46,539 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 16:28:46,571 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 16:28:46,576 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-15 16:28:46,576 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 16:28:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 16:28:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-15 16:28:46,594 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:28:46,595 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:28:46,595 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:28:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:28:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times
[2022-04-15 16:28:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:28:46,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363689606]
[2022-04-15 16:28:46,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:28:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times
[2022-04-15 16:28:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:28:46,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584759919]
[2022-04-15 16:28:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:28:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:28:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:28:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 16:28:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:28:46,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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; {25#true} is VALID
[2022-04-15 16:28:46,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID
[2022-04-15 16:28:46,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID
[2022-04-15 16:28:46,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 16:28:46,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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; {25#true} is VALID
[2022-04-15 16:28:46,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID
[2022-04-15 16:28:46,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID
[2022-04-15 16:28:46,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID
[2022-04-15 16:28:46,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID
[2022-04-15 16:28:46,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID
[2022-04-15 16:28:46,784 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {26#false} is VALID
[2022-04-15 16:28:46,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID
[2022-04-15 16:28:46,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID
[2022-04-15 16:28:46,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID
[2022-04-15 16:28:46,785 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-15 16:28:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 16:28:46,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584759919]
[2022-04-15 16:28:46,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584759919] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:28:46,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:28:46,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 16:28:46,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 16:28:46,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363689606]
[2022-04-15 16:28:46,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363689606] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:28:46,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:28:46,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 16:28:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724996464]
[2022-04-15 16:28:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 16:28:46,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-15 16:28:46,796 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 16:28:46,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:46,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:46,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 16:28:46,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:28:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 16:28:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 16:28:46,840 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:46,968 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions.
[2022-04-15 16:28:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 16:28:46,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-15 16:28:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 16:28:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions.
[2022-04-15 16:28:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions.
[2022-04-15 16:28:46,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions.
[2022-04-15 16:28:47,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:47,073 INFO L225 Difference]: With dead ends: 39
[2022-04-15 16:28:47,073 INFO L226 Difference]: Without dead ends: 18
[2022-04-15 16:28:47,076 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 16:28:47,083 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 16:28:47,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 16:28:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2022-04-15 16:28:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17.
[2022-04-15 16:28:47,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 16:28:47,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,114 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,114 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:47,118 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions.
[2022-04-15 16:28:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2022-04-15 16:28:47,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:28:47,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:28:47,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states.
[2022-04-15 16:28:47,120 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states.
[2022-04-15 16:28:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:47,122 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions.
[2022-04-15 16:28:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2022-04-15 16:28:47,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:28:47,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:28:47,122 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 16:28:47,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 16:28:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions.
[2022-04-15 16:28:47,125 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11
[2022-04-15 16:28:47,125 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 16:28:47,126 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions.
[2022-04-15 16:28:47,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:47,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions.
[2022-04-15 16:28:47,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions.
[2022-04-15 16:28:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 16:28:47,147 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:28:47,148 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:28:47,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 16:28:47,148 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:28:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:28:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times
[2022-04-15 16:28:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:28:47,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1865074417]
[2022-04-15 16:28:47,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:28:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times
[2022-04-15 16:28:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:28:47,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945647346]
[2022-04-15 16:28:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:28:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:28:47,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 16:28:47,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150385391]
[2022-04-15 16:28:47,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 16:28:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 16:28:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:28:47,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 16:28:47,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-15 16:28:47,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 16:28:47,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 16:28:47,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 16:28:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:28:47,262 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 16:28:47,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID
[2022-04-15 16:28:47,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#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; {189#(<= ~counter~0 0)} is VALID
[2022-04-15 16:28:47,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(<= ~counter~0 0)} assume true; {189#(<= ~counter~0 0)} is VALID
[2022-04-15 16:28:47,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#(<= ~counter~0 0)} {181#true} #54#return; {189#(<= ~counter~0 0)} is VALID
[2022-04-15 16:28:47,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#(<= ~counter~0 0)} call #t~ret6 := main(); {189#(<= ~counter~0 0)} is VALID
[2022-04-15 16:28:47,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {189#(<= ~counter~0 0)} is VALID
[2022-04-15 16:28:47,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {205#(<= |main_#t~post5| 0)} is VALID
[2022-04-15 16:28:47,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {182#false} is VALID
[2022-04-15 16:28:47,381 INFO L272 TraceCheckUtils]: 8: Hoare triple {182#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {182#false} is VALID
[2022-04-15 16:28:47,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} ~cond := #in~cond; {182#false} is VALID
[2022-04-15 16:28:47,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume 0 == ~cond; {182#false} is VALID
[2022-04-15 16:28:47,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#false} assume !false; {182#false} is VALID
[2022-04-15 16:28:47,382 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-15 16:28:47,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 16:28:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 16:28:47,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945647346]
[2022-04-15 16:28:47,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 16:28:47,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150385391]
[2022-04-15 16:28:47,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150385391] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:28:47,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:28:47,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 16:28:47,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 16:28:47,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1865074417]
[2022-04-15 16:28:47,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1865074417] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:28:47,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:28:47,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 16:28:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898133879]
[2022-04-15 16:28:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 16:28:47,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-15 16:28:47,388 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 16:28:47,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:47,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:47,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 16:28:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:28:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 16:28:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 16:28:47,400 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:47,459 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions.
[2022-04-15 16:28:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-15 16:28:47,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-15 16:28:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 16:28:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions.
[2022-04-15 16:28:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions.
[2022-04-15 16:28:47,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions.
[2022-04-15 16:28:47,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:47,499 INFO L225 Difference]: With dead ends: 26
[2022-04-15 16:28:47,499 INFO L226 Difference]: Without dead ends: 19
[2022-04-15 16:28:47,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 16:28:47,502 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 16:28:47,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 16:28:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2022-04-15 16:28:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2022-04-15 16:28:47,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 16:28:47,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,522 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,523 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:47,526 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions.
[2022-04-15 16:28:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-15 16:28:47,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:28:47,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:28:47,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states.
[2022-04-15 16:28:47,527 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states.
[2022-04-15 16:28:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:47,530 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions.
[2022-04-15 16:28:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-15 16:28:47,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:28:47,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:28:47,531 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 16:28:47,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 16:28:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 16:28:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions.
[2022-04-15 16:28:47,532 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12
[2022-04-15 16:28:47,533 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 16:28:47,533 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions.
[2022-04-15 16:28:47,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:47,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions.
[2022-04-15 16:28:47,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-15 16:28:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 16:28:47,553 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:28:47,554 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:28:47,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2022-04-15 16:28:47,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 16:28:47,756 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:28:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:28:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times
[2022-04-15 16:28:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:28:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918740180]
[2022-04-15 16:28:47,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 16:28:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times
[2022-04-15 16:28:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 16:28:47,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762248319]
[2022-04-15 16:28:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 16:28:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 16:28:47,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 16:28:47,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232047954]
[2022-04-15 16:28:47,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 16:28:47,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 16:28:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 16:28:47,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 16:28:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-15 16:28:47,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 16:28:47,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 16:28:47,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 16:28:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 16:28:47,830 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 16:28:47,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID
[2022-04-15 16:28:47,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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; {348#true} is VALID
[2022-04-15 16:28:47,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID
[2022-04-15 16:28:47,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #54#return; {348#true} is VALID
[2022-04-15 16:28:47,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret6 := main(); {348#true} is VALID
[2022-04-15 16:28:47,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 16:28:47,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 16:28:47,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 16:28:47,939 INFO L272 TraceCheckUtils]: 8: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 16:28:47,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 16:28:47,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID
[2022-04-15 16:28:47,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID
[2022-04-15 16:28:47,941 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-15 16:28:47,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 16:28:47,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 16:28:47,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762248319]
[2022-04-15 16:28:47,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 16:28:47,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232047954]
[2022-04-15 16:28:47,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232047954] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:28:47,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:28:47,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 16:28:47,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 16:28:47,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918740180]
[2022-04-15 16:28:47,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918740180] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 16:28:47,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 16:28:47,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 16:28:47,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832279119]
[2022-04-15 16:28:47,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 16:28:47,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-15 16:28:47,943 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 16:28:47,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:47,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:47,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 16:28:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:28:47,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 16:28:47,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 16:28:47,956 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:48,080 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions.
[2022-04-15 16:28:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 16:28:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-15 16:28:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 16:28:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions.
[2022-04-15 16:28:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions.
[2022-04-15 16:28:48,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions.
[2022-04-15 16:28:48,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 16:28:48,116 INFO L225 Difference]: With dead ends: 28
[2022-04-15 16:28:48,116 INFO L226 Difference]: Without dead ends: 25
[2022-04-15 16:28:48,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-15 16:28:48,122 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 16:28:48,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 16:28:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2022-04-15 16:28:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2022-04-15 16:28:48,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 16:28:48,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 16:28:48,141 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 16:28:48,141 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 16:28:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:48,143 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions.
[2022-04-15 16:28:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-15 16:28:48,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:28:48,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:28:48,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states.
[2022-04-15 16:28:48,145 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states.
[2022-04-15 16:28:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 16:28:48,150 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions.
[2022-04-15 16:28:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-15 16:28:48,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 16:28:48,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 16:28:48,150 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 16:28:48,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 16:28:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 16:28:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions.
[2022-04-15 16:28:48,153 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12
[2022-04-15 16:28:48,153 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 16:28:48,153 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions.
[2022-04-15 16:28:48,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 16:28:48,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions.
[2022-04-15 16:28:48,178 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-15 16:28:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-15 16:28:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-15 16:28:48,180 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 16:28:48,180 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 16:28:48,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-15 16:28:48,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-15 16:28:48,400 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 16:28:48,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 16:28:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times
[2022-04-15 16:28:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 16:28:48,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139497384]