/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 10:41:38,417 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 10:41:38,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 10:41:38,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 10:41:38,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 10:41:38,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 10:41:38,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 10:41:38,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 10:41:38,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 10:41:38,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 10:41:38,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 10:41:38,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 10:41:38,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 10:41:38,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 10:41:38,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 10:41:38,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 10:41:38,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 10:41:38,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 10:41:38,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 10:41:38,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 10:41:38,456 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 10:41:38,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 10:41:38,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 10:41:38,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 10:41:38,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 10:41:38,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 10:41:38,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 10:41:38,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 10:41:38,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 10:41:38,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 10:41:38,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 10:41:38,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 10:41:38,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 10:41:38,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 10:41:38,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 10:41:38,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 10:41:38,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 10:41:38,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 10:41:38,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 10:41:38,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 10:41:38,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 10:41:38,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 10:41:38,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-15 10:41:38,476 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 10:41:38,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 10:41:38,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 10:41:38,477 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-15 10:41:38,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 10:41:38,477 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-15 10:41:38,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 10:41:38,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 10:41:38,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 10:41:38,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 10:41:38,478 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-15 10:41:38,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 10:41:38,478 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 10:41:38,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 10:41:38,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 10:41:38,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 10:41:38,479 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 10:41:38,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 10:41:38,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 10:41:38,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 10:41:38,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 10:41:38,480 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 10:41:38,480 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 10:41:38,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 10:41:38,481 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-15 10:41:38,481 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 10:41:38,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 10:41:38,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 10:41:38,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 10:41:38,685 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 10:41:38,686 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 10:41:38,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c
[2022-04-15 10:41:38,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f720212a7/efe29bc6edfd4bd6a487bd03e95d3578/FLAGf1752fd29
[2022-04-15 10:41:39,098 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 10:41:39,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_valuebound5.c
[2022-04-15 10:41:39,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f720212a7/efe29bc6edfd4bd6a487bd03e95d3578/FLAGf1752fd29
[2022-04-15 10:41:39,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f720212a7/efe29bc6edfd4bd6a487bd03e95d3578
[2022-04-15 10:41:39,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 10:41:39,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 10:41:39,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 10:41:39,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 10:41:39,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 10:41:39,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc151f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39, skipping insertion in model container
[2022-04-15 10:41:39,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 10:41:39,559 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 10:41:39,686 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_valuebound5.c[454,467]
[2022-04-15 10:41:39,696 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 10:41:39,703 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 10:41:39,713 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_valuebound5.c[454,467]
[2022-04-15 10:41:39,717 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 10:41:39,726 INFO L208 MainTranslator]: Completed translation
[2022-04-15 10:41:39,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39 WrapperNode
[2022-04-15 10:41:39,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 10:41:39,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 10:41:39,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 10:41:39,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 10:41:39,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 10:41:39,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 10:41:39,759 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 10:41:39,759 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 10:41:39,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (1/1) ...
[2022-04-15 10:41:39,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 10:41:39,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:41:39,795 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 10:41:39,798 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 10:41:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 10:41:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 10:41:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 10:41:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 10:41:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 10:41:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 10:41:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 10:41:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 10:41:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 10:41:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 10:41:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-15 10:41:39,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 10:41:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 10:41:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 10:41:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 10:41:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 10:41:39,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 10:41:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 10:41:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 10:41:39,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 10:41:39,871 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 10:41:39,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 10:41:39,983 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 10:41:40,003 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 10:41:40,003 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 10:41:40,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:41:40 BoogieIcfgContainer
[2022-04-15 10:41:40,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 10:41:40,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 10:41:40,006 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 10:41:40,013 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 10:41:40,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:41:39" (1/3) ...
[2022-04-15 10:41:40,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3f641a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:41:40, skipping insertion in model container
[2022-04-15 10:41:40,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:41:39" (2/3) ...
[2022-04-15 10:41:40,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3f641a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:41:40, skipping insertion in model container
[2022-04-15 10:41:40,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:41:40" (3/3) ...
[2022-04-15 10:41:40,022 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound5.c
[2022-04-15 10:41:40,026 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 10:41:40,026 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 10:41:40,068 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 10:41:40,074 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 10:41:40,074 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 10:41:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-15 10:41:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-15 10:41:40,100 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:41:40,100 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:41:40,101 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:41:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:41:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 1 times
[2022-04-15 10:41:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:41:40,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258467566]
[2022-04-15 10:41:40,122 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:41:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 2 times
[2022-04-15 10:41:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:41:40,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655235682]
[2022-04-15 10:41:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:41:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:41:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:41:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 10:41:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:41:40,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#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); {30#true} is VALID
[2022-04-15 10:41:40,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID
[2022-04-15 10:41:40,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID
[2022-04-15 10:41:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 10:41:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:41:40,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID
[2022-04-15 10:41:40,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID
[2022-04-15 10:41:40,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID
[2022-04-15 10:41:40,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID
[2022-04-15 10:41:40,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 10:41:40,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#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); {30#true} is VALID
[2022-04-15 10:41:40,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID
[2022-04-15 10:41:40,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID
[2022-04-15 10:41:40,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID
[2022-04-15 10:41:40,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#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; {30#true} is VALID
[2022-04-15 10:41:40,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {30#true} is VALID
[2022-04-15 10:41:40,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID
[2022-04-15 10:41:40,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID
[2022-04-15 10:41:40,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume true; {31#false} is VALID
[2022-04-15 10:41:40,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID
[2022-04-15 10:41:40,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31#false} is VALID
[2022-04-15 10:41:40,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume false; {31#false} is VALID
[2022-04-15 10:41:40,340 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {31#false} is VALID
[2022-04-15 10:41:40,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID
[2022-04-15 10:41:40,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID
[2022-04-15 10:41:40,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID
[2022-04-15 10:41:40,341 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 10:41:40,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:41:40,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655235682]
[2022-04-15 10:41:40,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655235682] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:41:40,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:41:40,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 10:41:40,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:41:40,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258467566]
[2022-04-15 10:41:40,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258467566] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:41:40,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:41:40,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 10:41:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901540130]
[2022-04-15 10:41:40,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:41:40,351 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-15 10:41:40,352 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:41:40,354 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-15 10:41:40,375 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-15 10:41:40,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 10:41:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:41:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 10:41:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 10:41:40,395 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-15 10:41:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:41:40,478 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions.
[2022-04-15 10:41:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 10:41:40,478 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-15 10:41:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:41:40,480 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-15 10:41:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2022-04-15 10:41:40,487 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-15 10:41:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2022-04-15 10:41:40,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions.
[2022-04-15 10:41:40,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:41:40,560 INFO L225 Difference]: With dead ends: 45
[2022-04-15 10:41:40,561 INFO L226 Difference]: Without dead ends: 22
[2022-04-15 10:41:40,563 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-15 10:41:40,566 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 10:41:40,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 10:41:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2022-04-15 10:41:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2022-04-15 10:41:40,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:41:40,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 10:41:40,593 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 10:41:40,593 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 10:41:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:41:40,596 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions.
[2022-04-15 10:41:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions.
[2022-04-15 10:41:40,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:41:40,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:41:40,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states.
[2022-04-15 10:41:40,598 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states.
[2022-04-15 10:41:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:41:40,600 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions.
[2022-04-15 10:41:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions.
[2022-04-15 10:41:40,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:41:40,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:41:40,601 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:41:40,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:41:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 10:41:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions.
[2022-04-15 10:41:40,604 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17
[2022-04-15 10:41:40,604 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:41:40,604 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions.
[2022-04-15 10:41:40,605 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-15 10:41:40,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions.
[2022-04-15 10:41:40,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:41:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions.
[2022-04-15 10:41:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-15 10:41:40,631 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:41:40,631 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:41:40,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 10:41:40,631 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:41:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:41:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 1 times
[2022-04-15 10:41:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:41:40,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913444458]
[2022-04-15 10:41:40,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:41:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 2 times
[2022-04-15 10:41:40,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:41:40,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223874285]
[2022-04-15 10:41:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:41:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:41:40,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:41:40,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007427601]
[2022-04-15 10:41:40,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:41:40,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:41:40,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:41:40,653 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 10:41:40,659 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 10:41:40,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 10:41:40,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:41:40,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 10:41:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:41:40,724 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:41:40,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID
[2022-04-15 10:41:40,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#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); {220#true} is VALID
[2022-04-15 10:41:40,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID
[2022-04-15 10:41:40,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #57#return; {220#true} is VALID
[2022-04-15 10:41:40,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret5 := main(); {220#true} is VALID
[2022-04-15 10:41:40,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#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; {220#true} is VALID
[2022-04-15 10:41:40,888 INFO L272 TraceCheckUtils]: 6: Hoare triple {220#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {220#true} is VALID
[2022-04-15 10:41:40,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#true} ~cond := #in~cond; {220#true} is VALID
[2022-04-15 10:41:40,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#true} assume !(0 == ~cond); {220#true} is VALID
[2022-04-15 10:41:40,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#true} assume true; {220#true} is VALID
[2022-04-15 10:41:40,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {220#true} {220#true} #51#return; {220#true} is VALID
[2022-04-15 10:41:40,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {220#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:41:40,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:41:40,892 INFO L272 TraceCheckUtils]: 13: Hoare triple {258#(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)); {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:41:40,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:41:40,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {221#false} is VALID
[2022-04-15 10:41:40,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID
[2022-04-15 10:41:40,894 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 10:41:40,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 10:41:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:41:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223874285]
[2022-04-15 10:41:40,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:41:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007427601]
[2022-04-15 10:41:40,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007427601] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:41:40,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:41:40,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:41:40,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:41:40,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913444458]
[2022-04-15 10:41:40,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913444458] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:41:40,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:41:40,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:41:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136278525]
[2022-04-15 10:41:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:41:40,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 17
[2022-04-15 10:41:40,900 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:41:40,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 10:41:40,915 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-15 10:41:40,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 10:41:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:41:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 10:41:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 10:41:40,917 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 10:41:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:41:41,022 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions.
[2022-04-15 10:41:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 10:41:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 17
[2022-04-15 10:41:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:41:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 10:41:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions.
[2022-04-15 10:41:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 10:41:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions.
[2022-04-15 10:41:41,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions.
[2022-04-15 10:41:41,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:41:41,056 INFO L225 Difference]: With dead ends: 32
[2022-04-15 10:41:41,056 INFO L226 Difference]: Without dead ends: 29
[2022-04-15 10:41:41,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 10:41:41,058 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 10:41:41,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 10:41:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2022-04-15 10:41:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2022-04-15 10:41:41,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:41:41,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:41:41,069 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:41:41,070 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:41:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:41:41,071 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-15 10:41:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-15 10:41:41,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:41:41,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:41:41,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states.
[2022-04-15 10:41:41,073 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states.
[2022-04-15 10:41:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:41:41,075 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-15 10:41:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-15 10:41:41,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:41:41,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:41:41,076 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:41:41,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:41:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 10:41:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions.
[2022-04-15 10:41:41,078 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17
[2022-04-15 10:41:41,078 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:41:41,078 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions.
[2022-04-15 10:41:41,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 10:41:41,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions.
[2022-04-15 10:41:41,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 10:41:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-15 10:41:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-15 10:41:41,109 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:41:41,109 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:41:41,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-15 10:41:41,332 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 10:41:41,332 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:41:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:41:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash 276758134, now seen corresponding path program 1 times
[2022-04-15 10:41:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:41:41,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385598985]
[2022-04-15 10:41:42,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult
[2022-04-15 10:41:42,031 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE
[2022-04-15 10:41:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 22480176, now seen corresponding path program 1 times
[2022-04-15 10:41:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:41:42,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161012087]
[2022-04-15 10:41:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:41:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:41:42,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:41:42,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964493396]
[2022-04-15 10:41:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:41:42,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:41:42,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:41:42,054 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 10:41:42,063 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 10:41:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:41:42,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-15 10:41:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2022-04-15 10:41:44,715 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:44:36,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID
[2022-04-15 10:44:36,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#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); {457#true} is VALID
[2022-04-15 10:44:36,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-15 10:44:36,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #57#return; {457#true} is VALID
[2022-04-15 10:44:36,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID
[2022-04-15 10:44:36,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#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; {457#true} is VALID
[2022-04-15 10:44:36,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {457#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {457#true} is VALID
[2022-04-15 10:44:36,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID
[2022-04-15 10:44:36,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID
[2022-04-15 10:44:36,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-15 10:44:36,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {457#true} {457#true} #51#return; {457#true} is VALID
[2022-04-15 10:44:36,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {495#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:44:36,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {495#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [61] L27-2-->L28_primed: Formula: (let ((.cse0 (= v_main_~c~0_7 v_main_~c~0_6)) (.cse1 (= v_main_~x~0_12 v_main_~x~0_11)) (.cse2 (= v_main_~y~0_12 v_main_~y~0_11)) (.cse4 (* (- 1) v_main_~c~0_7)) (.cse5 (= (* v_main_~x~0_12 2) (+ v_main_~y~0_12 (* v_main_~y~0_12 v_main_~y~0_12)))) (.cse6 (* (- 1) v_main_~c~0_6))) (or (and .cse0 .cse1 .cse2 (= v_main_~k~0_8 v_main_~k~0_8)) (let ((.cse3 (div (+ v_main_~c~0_7 .cse6) (- 2)))) (and (< .cse3 (+ (div (+ (- 2) v_main_~k~0_8 .cse4) 2) 2)) (= v_main_~y~0_11 (+ v_main_~y~0_12 (* 2 .cse3))) (< 0 .cse3) (= v_main_~x~0_11 (+ v_main_~x~0_12 (* 2 (* .cse3 .cse3)) .cse3 (* (* v_main_~y~0_12 .cse3) 2))) .cse5 (= (mod (+ v_main_~c~0_7 v_main_~c~0_6) 2) 0))) (and .cse0 .cse1 (or (not .cse5) (not (< v_main_~c~0_7 v_main_~k~0_8))) .cse2) (let ((.cse7 (div (+ v_main_~c~0_7 .cse6 1) (- 2)))) (and (= v_main_~x~0_11 (+ v_main_~x~0_12 v_main_~y~0_12 (* 2 (* .cse7 .cse7)) (* (* v_main_~y~0_12 .cse7) 2) (* 3 .cse7) 1)) (= (mod (+ v_main_~c~0_7 v_main_~c~0_6 1) 2) 0) (< .cse7 (+ (div (+ (- 1) v_main_~k~0_8 .cse4) 2) 1)) (<= 0 .cse7) .cse5 (= v_main_~y~0_11 (+ v_main_~y~0_12 (* 2 .cse7) 1)))))) InVars {main_~y~0=v_main_~y~0_12, main_~c~0=v_main_~c~0_7, main_~x~0=v_main_~x~0_12, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_11, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_11, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} is VALID
[2022-04-15 10:44:36,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} [60] L28_primed-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} is VALID
[2022-04-15 10:44:36,767 INFO L272 TraceCheckUtils]: 14: Hoare triple {499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1))))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {506#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:44:36,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {506#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {510#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:44:36,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID
[2022-04-15 10:44:36,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {458#false} assume !false; {458#false} is VALID
[2022-04-15 10:44:36,769 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 10:44:36,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 10:44:36,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:44:36,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161012087]
[2022-04-15 10:44:36,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:44:36,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964493396]
[2022-04-15 10:44:36,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964493396] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:36,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:36,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 10:47:04,624 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_main_~x~0_BEFORE_CALL_4 Int) (v_main_~y~0_BEFORE_CALL_4 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (let ((.cse3 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1)) (.cse5 (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))) (and (or (exists ((aux_div_v_main_~c~0_BEFORE_CALL_1_47 Int) (aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 Int)) (let ((.cse0 (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 2))) (and (<= 0 .cse0) (< aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 aux_div_v_main_~c~0_BEFORE_CALL_1_47) (= (* (div (+ (* (- 2) aux_div_v_main_~c~0_BEFORE_CALL_1_47) .cse0) (- 2)) 2) v_main_~y~0_BEFORE_CALL_4) (< .cse0 2) (= v_main_~x~0_BEFORE_CALL_4 (+ (* 2 (* aux_div_v_main_~c~0_BEFORE_CALL_1_47 aux_div_v_main_~c~0_BEFORE_CALL_1_47)) aux_div_v_main_~c~0_BEFORE_CALL_1_47))))) (exists ((aux_div_v_main_~c~0_BEFORE_CALL_1_53 Int) (aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 Int)) (let ((.cse2 (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 2))) (let ((.cse1 (div (+ .cse2 (* (- 2) aux_div_v_main_~c~0_BEFORE_CALL_1_53)) (- 2)))) (and (= (+ (* 2 .cse1) 1) v_main_~y~0_BEFORE_CALL_4) (<= 0 aux_div_v_main_~c~0_BEFORE_CALL_1_53) (< .cse2 2) (= v_main_~x~0_BEFORE_CALL_4 (+ (* 3 .cse1) (* 2 (* .cse1 .cse1)) 1)) (<= 0 .cse2))))) (and (= v_main_~x~0_BEFORE_CALL_4 0) (= v_main_~y~0_BEFORE_CALL_4 0))) (let ((.cse4 (= (+ (- 1) (* 3 c_main_~y~0) (* (- 2) c_main_~x~0) (let ((.cse6 (+ (- 1) c_main_~y~0))) (* .cse6 .cse6))) 0))) (or (and .cse3 .cse4) (and (not .cse4) .cse5))) (let ((.cse7 (= (+ (* v_main_~x~0_BEFORE_CALL_4 (- 2)) (* v_main_~y~0_BEFORE_CALL_4 v_main_~y~0_BEFORE_CALL_4) v_main_~y~0_BEFORE_CALL_4) 0))) (or (and .cse3 .cse7) (and (not .cse7) .cse5)))))) (< c_main_~c~0 (+ c_main_~k~0 1))) is different from false
[2022-04-15 10:47:04,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:47:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385598985]
[2022-04-15 10:47:04,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385598985] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:47:04,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:47:04,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-15 10:47:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394276420]
[2022-04-15 10:47:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:47:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24
[2022-04-15 10:47:04,629 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:47:04,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 10:47:04,965 WARN L143 InductivityCheck]: Transition 518#(and (exists ((v_main_~x~0_BEFORE_CALL_4 Int) (v_main_~y~0_BEFORE_CALL_4 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (and (or (exists ((aux_div_v_main_~c~0_BEFORE_CALL_1_47 Int) (aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 Int)) (and (<= 0 (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 2)) (< aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 aux_div_v_main_~c~0_BEFORE_CALL_1_47) (= (* (div (+ (* (- 2) aux_div_v_main_~c~0_BEFORE_CALL_1_47) (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 2)) (- 2)) 2) v_main_~y~0_BEFORE_CALL_4) (< (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_47_44 2) 2) (= v_main_~x~0_BEFORE_CALL_4 (+ (* 2 (* aux_div_v_main_~c~0_BEFORE_CALL_1_47 aux_div_v_main_~c~0_BEFORE_CALL_1_47)) aux_div_v_main_~c~0_BEFORE_CALL_1_47)))) (exists ((aux_div_v_main_~c~0_BEFORE_CALL_1_53 Int) (aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 Int)) (and (= (+ (* 2 (div (+ (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 2) (* (- 2) aux_div_v_main_~c~0_BEFORE_CALL_1_53)) (- 2))) 1) v_main_~y~0_BEFORE_CALL_4) (<= 0 aux_div_v_main_~c~0_BEFORE_CALL_1_53) (< (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 2) 2) (= v_main_~x~0_BEFORE_CALL_4 (+ (* 3 (div (+ (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 2) (* (- 2) aux_div_v_main_~c~0_BEFORE_CALL_1_53)) (- 2))) (* 2 (* (div (+ (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 2) (* (- 2) aux_div_v_main_~c~0_BEFORE_CALL_1_53)) (- 2)) (div (+ (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 2) (* (- 2) aux_div_v_main_~c~0_BEFORE_CALL_1_53)) (- 2)))) 1)) (<= 0 (* aux_div_aux_mod_v_main_~c~0_BEFORE_CALL_1_53_44 2)))) (and (= v_main_~x~0_BEFORE_CALL_4 0) (= v_main_~y~0_BEFORE_CALL_4 0))) (or (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (= (+ (* v_main_~x~0_BEFORE_CALL_4 (- 2)) (* v_main_~y~0_BEFORE_CALL_4 v_main_~y~0_BEFORE_CALL_4) v_main_~y~0_BEFORE_CALL_4) 0)) (and (not (= (+ (* v_main_~x~0_BEFORE_CALL_4 (- 2)) (* v_main_~y~0_BEFORE_CALL_4 v_main_~y~0_BEFORE_CALL_4) v_main_~y~0_BEFORE_CALL_4) 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))) (or (and (= (+ (- 1) (* (- 2) main_~x~0) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* main_~y~0 3)) 0) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1)) (and (not (= (+ (- 1) (* (- 2) main_~x~0) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* main_~y~0 3)) 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))))) (< main_~c~0 (+ main_~k~0 1))) ( _ , assume !false; , 499#(or (and (= main_~x~0 0) (= main_~y~0 0)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) 2) (< aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50 (div (* (- 1) main_~y~0) (- 2))) (= (+ (* 2 (* (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2)))) (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_main_~c~0_31_67_89_50) (* (- 2) (div (* (- 1) main_~y~0) (- 2)))) (- 2))) main_~x~0))) (= (mod main_~y~0 2) 0)) (and (exists ((aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 Int)) (and (= (+ (* 2 (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 aux_div_aux_mod_aux_mod_main_~c~0_37_67_89)) (* aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 3) 1) main_~x~0) (< aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 (+ (div (+ (- 1) main_~y~0) 2) 1)) (< (div (+ (- 1) main_~y~0) 2) (+ aux_div_aux_mod_aux_mod_main_~c~0_37_67_89 1)))) (= (mod (+ main_~y~0 1) 2) 0) (< 0 (+ (div (+ (- 1) main_~y~0) 2) 1)))) ) not inductive
[2022-04-15 10:47:04,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2022-04-15 10:47:05,166 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 10:47:05,166 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.AssertionError: inductivity failed
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.<init>(InductivityCheck.java:75)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:153)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2022-04-15 10:47:05,170 INFO L158 Benchmark]: Toolchain (without parser) took 325637.74ms. Allocated memory was 181.4MB in the beginning and 254.8MB in the end (delta: 73.4MB). Free memory was 125.7MB in the beginning and 168.7MB in the end (delta: -42.9MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB.
[2022-04-15 10:47:05,170 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 181.4MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 10:47:05,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.43ms. Allocated memory is still 181.4MB. Free memory was 125.6MB in the beginning and 157.1MB in the end (delta: -31.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB.
[2022-04-15 10:47:05,171 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-15 10:47:05,171 INFO L158 Benchmark]: RCFGBuilder took 245.53ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 145.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-15 10:47:05,172 INFO L158 Benchmark]: TraceAbstraction took 325162.82ms. Allocated memory was 181.4MB in the beginning and 254.8MB in the end (delta: 73.4MB). Free memory was 144.5MB in the beginning and 168.7MB in the end (delta: -24.1MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB.
[2022-04-15 10:47:05,174 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.36ms. Allocated memory is still 181.4MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 191.43ms. Allocated memory is still 181.4MB. Free memory was 125.6MB in the beginning and 157.1MB in the end (delta: -31.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 31.03ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 245.53ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 145.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 325162.82ms. Allocated memory was 181.4MB in the beginning and 254.8MB in the end (delta: 73.4MB). Free memory was 144.5MB in the beginning and 168.7MB in the end (delta: -24.1MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: AssertionError: inductivity failed
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2022-04-15 10:47:05,226 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...