/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/sqrt1-ll_valuebound50.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 08:04:53,531 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 08:04:53,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 08:04:53,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 08:04:53,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 08:04:53,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 08:04:53,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 08:04:53,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 08:04:53,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 08:04:53,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 08:04:53,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 08:04:53,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 08:04:53,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 08:04:53,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 08:04:53,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 08:04:53,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 08:04:53,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 08:04:53,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 08:04:53,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 08:04:53,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 08:04:53,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 08:04:53,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 08:04:53,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 08:04:53,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 08:04:53,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 08:04:53,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 08:04:53,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 08:04:53,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 08:04:53,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 08:04:53,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 08:04:53,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 08:04:53,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 08:04:53,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 08:04:53,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 08:04:53,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 08:04:53,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 08:04:53,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 08:04:53,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 08:04:53,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 08:04:53,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 08:04:53,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 08:04:53,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 08:04:53,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-08 08:04:53,610 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 08:04:53,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 08:04:53,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 08:04:53,612 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-08 08:04:53,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 08:04:53,612 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-08 08:04:53,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 08:04:53,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 08:04:53,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 08:04:53,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 08:04:53,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 08:04:53,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 08:04:53,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 08:04:53,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 08:04:53,614 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 08:04:53,614 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 08:04:53,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 08:04:53,614 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-08 08:04:53,614 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 08:04:53,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 08:04:53,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 08:04:53,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 08:04:53,796 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 08:04:53,797 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 08:04:53,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound50.c
[2022-04-08 08:04:53,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726344ff6/1d090e9a1ab149f090114a450bda7983/FLAG8aab6928d
[2022-04-08 08:04:54,189 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 08:04:54,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound50.c
[2022-04-08 08:04:54,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726344ff6/1d090e9a1ab149f090114a450bda7983/FLAG8aab6928d
[2022-04-08 08:04:54,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726344ff6/1d090e9a1ab149f090114a450bda7983
[2022-04-08 08:04:54,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 08:04:54,203 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 08:04:54,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 08:04:54,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 08:04:54,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 08:04:54,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3598ec55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54, skipping insertion in model container
[2022-04-08 08:04:54,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 08:04:54,219 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 08:04:54,343 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/sqrt1-ll_valuebound50.c[520,533]
[2022-04-08 08:04:54,352 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 08:04:54,362 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 08:04:54,369 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/sqrt1-ll_valuebound50.c[520,533]
[2022-04-08 08:04:54,373 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 08:04:54,387 INFO L208 MainTranslator]: Completed translation
[2022-04-08 08:04:54,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54 WrapperNode
[2022-04-08 08:04:54,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 08:04:54,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 08:04:54,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 08:04:54,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 08:04:54,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 08:04:54,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 08:04:54,421 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 08:04:54,421 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 08:04:54,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (1/1) ...
[2022-04-08 08:04:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 08:04:54,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:04:54,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 08:04:54,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 08:04:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 08:04:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 08:04:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 08:04:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 08:04:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 08:04:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 08:04:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 08:04:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 08:04:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 08:04:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 08:04:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 08:04:54,482 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 08:04:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 08:04:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 08:04:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 08:04:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 08:04:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 08:04:54,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 08:04:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 08:04:54,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 08:04:54,526 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 08:04:54,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 08:04:54,658 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 08:04:54,663 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 08:04:54,663 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 08:04:54,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:04:54 BoogieIcfgContainer
[2022-04-08 08:04:54,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 08:04:54,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 08:04:54,665 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 08:04:54,667 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 08:04:54,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:04:54" (1/3) ...
[2022-04-08 08:04:54,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a01370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:04:54, skipping insertion in model container
[2022-04-08 08:04:54,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:04:54" (2/3) ...
[2022-04-08 08:04:54,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a01370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:04:54, skipping insertion in model container
[2022-04-08 08:04:54,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:04:54" (3/3) ...
[2022-04-08 08:04:54,669 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound50.c
[2022-04-08 08:04:54,672 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 08:04:54,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 08:04:54,698 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 08:04:54,702 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 08:04:54,702 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 08:04:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 08:04:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 08:04:54,722 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:04:54,722 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:04:54,722 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:04:54,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:04:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times
[2022-04-08 08:04:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:54,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443290314]
[2022-04-08 08:04:54,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:04:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times
[2022-04-08 08:04:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:04:54,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382251274]
[2022-04-08 08:04:54,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:04:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:04:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:54,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 08:04:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:54,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID
[2022-04-08 08:04:54,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID
[2022-04-08 08:04:54,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID
[2022-04-08 08:04:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 08:04:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:54,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID
[2022-04-08 08:04:54,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID
[2022-04-08 08:04:54,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID
[2022-04-08 08:04:54,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID
[2022-04-08 08:04:54,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 08:04:54,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID
[2022-04-08 08:04:54,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID
[2022-04-08 08:04:54,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID
[2022-04-08 08:04:54,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID
[2022-04-08 08:04:54,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID
[2022-04-08 08:04:54,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {34#true} is VALID
[2022-04-08 08:04:54,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID
[2022-04-08 08:04:54,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID
[2022-04-08 08:04:54,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID
[2022-04-08 08:04:54,863 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID
[2022-04-08 08:04:54,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID
[2022-04-08 08:04:54,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID
[2022-04-08 08:04:54,863 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID
[2022-04-08 08:04:54,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID
[2022-04-08 08:04:54,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID
[2022-04-08 08:04:54,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID
[2022-04-08 08:04:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 08:04:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:04:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382251274]
[2022-04-08 08:04:54,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382251274] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:54,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:54,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 08:04:54,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:04:54,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [443290314]
[2022-04-08 08:04:54,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [443290314] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:54,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:54,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 08:04:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118892875]
[2022-04-08 08:04:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:04:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 08:04:54,873 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:04:54,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:54,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:04:54,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 08:04:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:54,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 08:04:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 08:04:54,907 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:54,998 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions.
[2022-04-08 08:04:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 08:04:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 08:04:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:04:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2022-04-08 08:04:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2022-04-08 08:04:55,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions.
[2022-04-08 08:04:55,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:04:55,112 INFO L225 Difference]: With dead ends: 53
[2022-04-08 08:04:55,112 INFO L226 Difference]: Without dead ends: 26
[2022-04-08 08:04:55,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 08:04:55,120 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 08:04:55,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 08:04:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-08 08:04:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2022-04-08 08:04:55,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:04:55,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 08:04:55,144 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 08:04:55,144 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 08:04:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:55,148 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions.
[2022-04-08 08:04:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2022-04-08 08:04:55,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:55,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:55,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states.
[2022-04-08 08:04:55,149 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states.
[2022-04-08 08:04:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:55,153 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions.
[2022-04-08 08:04:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2022-04-08 08:04:55,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:55,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:55,154 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:04:55,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:04:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 08:04:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions.
[2022-04-08 08:04:55,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17
[2022-04-08 08:04:55,159 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:04:55,159 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions.
[2022-04-08 08:04:55,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions.
[2022-04-08 08:04:55,207 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-08 08:04:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2022-04-08 08:04:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 08:04:55,208 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:04:55,208 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:04:55,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 08:04:55,209 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:04:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:04:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times
[2022-04-08 08:04:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:55,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [991374913]
[2022-04-08 08:04:55,213 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:04:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times
[2022-04-08 08:04:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:04:55,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265524448]
[2022-04-08 08:04:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:04:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:04:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:55,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 08:04:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:55,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID
[2022-04-08 08:04:55,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID
[2022-04-08 08:04:55,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID
[2022-04-08 08:04:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 08:04:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:55,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID
[2022-04-08 08:04:55,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID
[2022-04-08 08:04:55,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID
[2022-04-08 08:04:55,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID
[2022-04-08 08:04:55,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 08:04:55,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID
[2022-04-08 08:04:55,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID
[2022-04-08 08:04:55,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID
[2022-04-08 08:04:55,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID
[2022-04-08 08:04:55,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {256#true} is VALID
[2022-04-08 08:04:55,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {256#true} is VALID
[2022-04-08 08:04:55,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID
[2022-04-08 08:04:55,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID
[2022-04-08 08:04:55,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID
[2022-04-08 08:04:55,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID
[2022-04-08 08:04:55,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID
[2022-04-08 08:04:55,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID
[2022-04-08 08:04:55,325 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 08:04:55,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 08:04:55,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID
[2022-04-08 08:04:55,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID
[2022-04-08 08:04:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 08:04:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:04:55,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265524448]
[2022-04-08 08:04:55,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265524448] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:55,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:55,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 08:04:55,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:04:55,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [991374913]
[2022-04-08 08:04:55,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [991374913] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:55,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:55,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 08:04:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910842167]
[2022-04-08 08:04:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:04:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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-08 08:04:55,329 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:04:55,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:04:55,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 08:04:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 08:04:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-08 08:04:55,342 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:55,690 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions.
[2022-04-08 08:04:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 08:04:55,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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-08 08:04:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:04:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions.
[2022-04-08 08:04:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions.
[2022-04-08 08:04:55,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions.
[2022-04-08 08:04:55,743 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-08 08:04:55,744 INFO L225 Difference]: With dead ends: 40
[2022-04-08 08:04:55,744 INFO L226 Difference]: Without dead ends: 38
[2022-04-08 08:04:55,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2022-04-08 08:04:55,745 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 08:04:55,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 08:04:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2022-04-08 08:04:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36.
[2022-04-08 08:04:55,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:04:55,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 08:04:55,753 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 08:04:55,753 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 08:04:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:55,755 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions.
[2022-04-08 08:04:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions.
[2022-04-08 08:04:55,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:55,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:55,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states.
[2022-04-08 08:04:55,757 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states.
[2022-04-08 08:04:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:55,759 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions.
[2022-04-08 08:04:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions.
[2022-04-08 08:04:55,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:55,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:55,760 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:04:55,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:04:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 08:04:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions.
[2022-04-08 08:04:55,762 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17
[2022-04-08 08:04:55,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:04:55,762 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions.
[2022-04-08 08:04:55,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 08:04:55,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions.
[2022-04-08 08:04:55,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:04:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions.
[2022-04-08 08:04:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-08 08:04:55,797 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:04:55,797 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:04:55,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 08:04:55,797 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:04:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:04:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times
[2022-04-08 08:04:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:55,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663345440]
[2022-04-08 08:04:55,798 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:04:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times
[2022-04-08 08:04:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:04:55,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968383646]
[2022-04-08 08:04:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:04:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:04:55,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:04:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140104736]
[2022-04-08 08:04:55,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:04:55,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:04:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:04:55,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:04:55,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-08 08:04:55,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 08:04:55,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:04:55,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 08:04:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:55,865 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:04:55,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID
[2022-04-08 08:04:55,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID
[2022-04-08 08:04:55,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID
[2022-04-08 08:04:55,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID
[2022-04-08 08:04:55,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID
[2022-04-08 08:04:55,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {507#true} is VALID
[2022-04-08 08:04:55,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {507#true} is VALID
[2022-04-08 08:04:55,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID
[2022-04-08 08:04:55,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID
[2022-04-08 08:04:55,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID
[2022-04-08 08:04:55,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID
[2022-04-08 08:04:55,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID
[2022-04-08 08:04:55,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID
[2022-04-08 08:04:55,976 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID
[2022-04-08 08:04:55,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID
[2022-04-08 08:04:55,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID
[2022-04-08 08:04:55,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID
[2022-04-08 08:04:55,977 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID
[2022-04-08 08:04:55,978 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:04:55,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:04:55,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID
[2022-04-08 08:04:55,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID
[2022-04-08 08:04:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 08:04:55,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 08:04:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:04:55,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968383646]
[2022-04-08 08:04:55,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:04:55,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140104736]
[2022-04-08 08:04:55,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140104736] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:55,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:55,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 08:04:55,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:04:55,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663345440]
[2022-04-08 08:04:55,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663345440] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:55,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:55,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 08:04:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22271559]
[2022-04-08 08:04:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:04:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-08 08:04:55,982 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:04:55,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 08:04:55,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:04:55,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 08:04:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:55,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 08:04:55,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 08:04:55,999 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 08:04:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:56,138 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions.
[2022-04-08 08:04:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 08:04:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-08 08:04:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:04:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 08:04:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions.
[2022-04-08 08:04:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 08:04:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions.
[2022-04-08 08:04:56,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions.
[2022-04-08 08:04:56,183 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-08 08:04:56,184 INFO L225 Difference]: With dead ends: 44
[2022-04-08 08:04:56,184 INFO L226 Difference]: Without dead ends: 42
[2022-04-08 08:04:56,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-08 08:04:56,186 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 08:04:56,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 08:04:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2022-04-08 08:04:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41.
[2022-04-08 08:04:56,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:04:56,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-08 08:04:56,195 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-08 08:04:56,196 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-08 08:04:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:56,198 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions.
[2022-04-08 08:04:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions.
[2022-04-08 08:04:56,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:56,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:56,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states.
[2022-04-08 08:04:56,199 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states.
[2022-04-08 08:04:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:56,200 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions.
[2022-04-08 08:04:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions.
[2022-04-08 08:04:56,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:56,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:56,201 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:04:56,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:04:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-08 08:04:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions.
[2022-04-08 08:04:56,203 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22
[2022-04-08 08:04:56,203 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:04:56,203 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions.
[2022-04-08 08:04:56,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 08:04:56,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions.
[2022-04-08 08:04:56,257 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-08 08:04:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions.
[2022-04-08 08:04:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2022-04-08 08:04:56,258 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:04:56,259 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:04:56,277 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-08 08:04:56,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:04:56,475 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:04:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:04:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times
[2022-04-08 08:04:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:56,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [898921573]
[2022-04-08 08:04:56,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 08:04:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times
[2022-04-08 08:04:56,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:04:56,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955648269]
[2022-04-08 08:04:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:04:56,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:04:56,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:04:56,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212980118]
[2022-04-08 08:04:56,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 08:04:56,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:04:56,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:04:56,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:04:56,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-08 08:04:56,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 08:04:56,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 08:04:56,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 08:04:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:04:56,548 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:04:56,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID
[2022-04-08 08:04:56,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID
[2022-04-08 08:04:56,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID
[2022-04-08 08:04:56,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID
[2022-04-08 08:04:56,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID
[2022-04-08 08:04:56,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#true} is VALID
[2022-04-08 08:04:56,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {833#true} is VALID
[2022-04-08 08:04:56,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID
[2022-04-08 08:04:56,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID
[2022-04-08 08:04:56,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID
[2022-04-08 08:04:56,669 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID
[2022-04-08 08:04:56,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID
[2022-04-08 08:04:56,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID
[2022-04-08 08:04:56,672 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID
[2022-04-08 08:04:56,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID
[2022-04-08 08:04:56,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID
[2022-04-08 08:04:56,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID
[2022-04-08 08:04:56,674 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID
[2022-04-08 08:04:56,674 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {833#true} is VALID
[2022-04-08 08:04:56,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID
[2022-04-08 08:04:56,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID
[2022-04-08 08:04:56,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID
[2022-04-08 08:04:56,675 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID
[2022-04-08 08:04:56,676 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:04:56,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:04:56,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID
[2022-04-08 08:04:56,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID
[2022-04-08 08:04:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-08 08:04:56,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 08:04:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:04:56,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955648269]
[2022-04-08 08:04:56,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:04:56,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212980118]
[2022-04-08 08:04:56,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212980118] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:56,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:56,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 08:04:56,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:04:56,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [898921573]
[2022-04-08 08:04:56,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [898921573] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:04:56,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:04:56,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 08:04:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090944771]
[2022-04-08 08:04:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:04:56,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27
[2022-04-08 08:04:56,681 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:04:56,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-08 08:04:56,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:04:56,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 08:04:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:56,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 08:04:56,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 08:04:56,697 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-08 08:04:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:56,823 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions.
[2022-04-08 08:04:56,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 08:04:56,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27
[2022-04-08 08:04:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 08:04:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-08 08:04:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions.
[2022-04-08 08:04:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-08 08:04:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions.
[2022-04-08 08:04:56,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions.
[2022-04-08 08:04:56,861 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-08 08:04:56,862 INFO L225 Difference]: With dead ends: 48
[2022-04-08 08:04:56,862 INFO L226 Difference]: Without dead ends: 43
[2022-04-08 08:04:56,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-08 08:04:56,863 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 08:04:56,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 08:04:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2022-04-08 08:04:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2022-04-08 08:04:56,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 08:04:56,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 08:04:56,876 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 08:04:56,877 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 08:04:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:56,878 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions.
[2022-04-08 08:04:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions.
[2022-04-08 08:04:56,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:56,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:56,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states.
[2022-04-08 08:04:56,879 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states.
[2022-04-08 08:04:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 08:04:56,881 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions.
[2022-04-08 08:04:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions.
[2022-04-08 08:04:56,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 08:04:56,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 08:04:56,881 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 08:04:56,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 08:04:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 08:04:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions.
[2022-04-08 08:04:56,883 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27
[2022-04-08 08:04:56,883 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 08:04:56,883 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions.
[2022-04-08 08:04:56,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-08 08:04:56,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions.
[2022-04-08 08:04:56,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 08:04:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions.
[2022-04-08 08:04:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-08 08:04:56,929 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 08:04:56,929 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 08:04:56,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 08:04:57,147 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,SelfDestructingSolverStorable3
[2022-04-08 08:04:57,148 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 08:04:57,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 08:04:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times
[2022-04-08 08:04:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 08:04:57,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [160681739]
[2022-04-08 08:05:01,720 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 08:05:01,723 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE
[2022-04-08 08:05:01,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1589942244, now seen corresponding path program 1 times
[2022-04-08 08:05:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 08:05:01,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387201287]
[2022-04-08 08:05:01,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:05:01,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 08:05:01,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 08:05:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842017312]
[2022-04-08 08:05:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 08:05:01,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:05:01,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 08:05:01,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 08:05:01,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-08 08:05:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:05:01,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core
[2022-04-08 08:05:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 08:05:01,812 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 08:05:11,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID
[2022-04-08 08:05:11,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID
[2022-04-08 08:05:11,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID
[2022-04-08 08:05:11,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID
[2022-04-08 08:05:11,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID
[2022-04-08 08:05:11,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID
[2022-04-08 08:05:11,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {1188#true} is VALID
[2022-04-08 08:05:11,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID
[2022-04-08 08:05:11,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID
[2022-04-08 08:05:11,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID
[2022-04-08 08:05:11,074 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID
[2022-04-08 08:05:11,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID
[2022-04-08 08:05:11,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} [73] L30-2-->L31_primed: Formula: (let ((.cse5 (= v_main_~t~0_18 v_main_~t~0_17)) (.cse6 (= v_main_~s~0_19 v_main_~s~0_18)) (.cse7 (= v_main_~a~0_18 v_main_~a~0_17)) (.cse0 (<= v_main_~s~0_19 v_main_~n~0_8)) (.cse8 (= (* v_main_~s~0_19 4) (+ (* v_main_~t~0_18 2) (* v_main_~t~0_18 v_main_~t~0_18) 1))) (.cse3 (= v_main_~t~0_18 (+ (* 2 v_main_~a~0_18) 1))) (.cse4 (* (- 1) v_main_~a~0_18))) (or (let ((.cse1 (div (+ .cse4 v_main_~a~0_17) 2))) (and .cse0 (< 0 .cse1) (= v_main_~t~0_17 (+ v_main_~t~0_18 (* .cse1 4))) (forall ((v_itHalf_1 Int)) (or (let ((.cse2 (* (* v_main_~t~0_18 v_itHalf_1) 2))) (and (<= (+ v_main_~s~0_19 v_main_~t~0_18 .cse2 2 (* v_itHalf_1 6) (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_8) (= (+ v_main_~s~0_19 v_main_~t~0_18 .cse2) (+ 2 (* (* v_itHalf_1 v_main_~a~0_18) 4) (* v_itHalf_1 2) (* 4 v_main_~a~0_18) (* v_main_~a~0_18 v_main_~a~0_18))))) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~a~0_18) v_main_~a~0_17) 2))) (not (<= 0 v_itHalf_1)))) (= v_main_~s~0_18 (+ (* .cse1 2) v_main_~s~0_19 (* 4 (* .cse1 .cse1)) (* (* v_main_~t~0_18 .cse1) 2))) .cse3 (= (mod (+ v_main_~a~0_18 v_main_~a~0_17) 2) 0))) (and .cse5 .cse6 .cse7 (= v_main_~n~0_8 v_main_~n~0_8)) (and (or (not .cse0) (not .cse3) (not .cse8)) .cse5 .cse6 .cse7) (let ((.cse9 (div (+ (- 1) .cse4 v_main_~a~0_17) 2))) (and .cse0 (= (+ v_main_~s~0_19 v_main_~t~0_18 2 (* 6 .cse9) (* (* v_main_~t~0_18 .cse9) 2) (* (* .cse9 .cse9) 4)) v_main_~s~0_18) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) (* (- 1) v_main_~a~0_18) v_main_~a~0_17) 2))) (not (<= 1 v_itHalf_1)) (let ((.cse11 (* (* v_main_~t~0_18 v_itHalf_1) 2)) (.cse10 (* v_itHalf_1 2))) (and (= (+ (* 2 v_main_~a~0_18) (* (* v_itHalf_1 v_main_~a~0_18) 4) .cse10 (* v_main_~a~0_18 v_main_~a~0_18) 1) (+ v_main_~s~0_19 .cse11)) (<= (+ v_main_~s~0_19 .cse11 .cse10 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_8))))) (<= 0 .cse9) (= v_main_~t~0_17 (+ v_main_~t~0_18 (* .cse9 4) 2)) (= (mod (+ 1 v_main_~a~0_18 v_main_~a~0_17) 2) 0) .cse8 .cse3)))) InVars {main_~t~0=v_main_~t~0_18, main_~n~0=v_main_~n~0_8, main_~s~0=v_main_~s~0_19, main_~a~0=v_main_~a~0_18} OutVars{main_~t~0=v_main_~t~0_17, main_~n~0=v_main_~n~0_8, main_~s~0=v_main_~s~0_18, main_~a~0=v_main_~a~0_17} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID
[2022-04-08 08:05:11,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} [72] L31_primed-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID
[2022-04-08 08:05:11,596 INFO L272 TraceCheckUtils]: 14: Hoare triple {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1237#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 08:05:11,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1241#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 08:05:11,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {1241#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID
[2022-04-08 08:05:11,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#false} assume !false; {1189#false} is VALID
[2022-04-08 08:05:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 08:05:11,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 08:05:11,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 08:05:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387201287]
[2022-04-08 08:05:11,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 08:05:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842017312]
[2022-04-08 08:05:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842017312] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:05:11,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:05:11,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 08:05:55,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 08:05:55,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [160681739]
[2022-04-08 08:05:55,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [160681739] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 08:05:55,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 08:05:55,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2022-04-08 08:05:55,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537723751]
[2022-04-08 08:05:55,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 08:05:55,794 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34
[2022-04-08 08:05:55,794 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 08:05:55,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5)
[2022-04-08 08:05:57,824 WARN L143 InductivityCheck]: Transition 1248#(exists ((v_main_~n~0_BEFORE_CALL_1 Int) (v_main_~s~0_BEFORE_CALL_8 Int) (v_main_~a~0_BEFORE_CALL_6 Int) (v_main_~t~0_BEFORE_CALL_7 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_4 Int)) (and (or (and (< 0 (div v_main_~a~0_BEFORE_CALL_6 2)) (= (+ (* (div v_main_~a~0_BEFORE_CALL_6 2) 4) 1) v_main_~t~0_BEFORE_CALL_7) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (<= (+ v_main_~s~0_BEFORE_CALL_8 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div v_main_~a~0_BEFORE_CALL_6 2) (div v_main_~a~0_BEFORE_CALL_6 2)) 4) (* (div v_main_~a~0_BEFORE_CALL_6 2) 4) v_main_~n~0_BEFORE_CALL_1)) (= v_main_~s~0_BEFORE_CALL_8 (+ (* (* (div v_main_~a~0_BEFORE_CALL_6 2) (div v_main_~a~0_BEFORE_CALL_6 2)) 4) (* (div v_main_~a~0_BEFORE_CALL_6 2) 4) 1))) (not (<= (+ v_itHalf_1 1) (div v_main_~a~0_BEFORE_CALL_6 2))))) (= (mod v_main_~a~0_BEFORE_CALL_6 2) 0)) (and (<= 0 (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2)) (= 0 (mod (+ v_main_~a~0_BEFORE_CALL_6 1) 2)) (<= 1 v_main_~n~0_BEFORE_CALL_1) (= (+ (* (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2) 4) 3) v_main_~t~0_BEFORE_CALL_7) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) v_main_~n~0_BEFORE_CALL_1) (not (<= v_itHalf_1 (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2))))) (= (+ (* (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2) 8) (* (* (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2) (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2)) 4) 4) v_main_~s~0_BEFORE_CALL_8)) (and (= v_main_~a~0_BEFORE_CALL_6 0) (= v_main_~t~0_BEFORE_CALL_7 1))) (or (and (= v_main_~t~0_BEFORE_CALL_7 (+ (* 2 v_main_~a~0_BEFORE_CALL_6) 1)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1)) (and (not (= v_main_~t~0_BEFORE_CALL_7 (+ (* 2 v_main_~a~0_BEFORE_CALL_6) 1))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))) (or (and (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0)) (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1) (= main_~t~0 (+ (* main_~a~0 2) 1)))))) ( _ , call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); , 1250#(exists ((v_main_~s~0_22 Int) (v_main_~a~0_22 Int)) (and (exists ((v_main_~n~0_BEFORE_CALL_1 Int) (v_main_~s~0_BEFORE_CALL_8 Int) (v_main_~a~0_BEFORE_CALL_6 Int) (v_main_~t~0_BEFORE_CALL_7 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_4 Int)) (and (or (and (< 0 (div v_main_~a~0_BEFORE_CALL_6 2)) (= (+ (* (div v_main_~a~0_BEFORE_CALL_6 2) 4) 1) v_main_~t~0_BEFORE_CALL_7) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (<= (+ v_main_~s~0_BEFORE_CALL_8 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div v_main_~a~0_BEFORE_CALL_6 2) (div v_main_~a~0_BEFORE_CALL_6 2)) 4) (* (div v_main_~a~0_BEFORE_CALL_6 2) 4) v_main_~n~0_BEFORE_CALL_1)) (= v_main_~s~0_BEFORE_CALL_8 (+ (* (* (div v_main_~a~0_BEFORE_CALL_6 2) (div v_main_~a~0_BEFORE_CALL_6 2)) 4) (* (div v_main_~a~0_BEFORE_CALL_6 2) 4) 1))) (not (<= (+ v_itHalf_1 1) (div v_main_~a~0_BEFORE_CALL_6 2))))) (= (mod v_main_~a~0_BEFORE_CALL_6 2) 0)) (and (<= 0 (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2)) (= 0 (mod (+ v_main_~a~0_BEFORE_CALL_6 1) 2)) (<= 1 v_main_~n~0_BEFORE_CALL_1) (= (+ (* (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2) 4) 3) v_main_~t~0_BEFORE_CALL_7) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) v_main_~n~0_BEFORE_CALL_1) (not (<= v_itHalf_1 (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2))))) (= (+ (* (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2) 8) (* (* (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2) (div (+ (- 1) v_main_~a~0_BEFORE_CALL_6) 2)) 4) 4) v_main_~s~0_BEFORE_CALL_8)) (and (= v_main_~a~0_BEFORE_CALL_6 0) (= v_main_~t~0_BEFORE_CALL_7 1))) (or (and (not (= (+ (* 2 v_main_~a~0_22) 1) main_~t~0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0)) (and (= (+ (* 2 v_main_~a~0_22) 1) main_~t~0) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1))) (or (and (= v_main_~t~0_BEFORE_CALL_7 (+ (* 2 v_main_~a~0_BEFORE_CALL_6) 1)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1)) (and (not (= v_main_~t~0_BEFORE_CALL_7 (+ (* 2 v_main_~a~0_BEFORE_CALL_6) 1))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))))) (or (and (= (* (+ 1 v_main_~a~0_22) (+ 1 v_main_~a~0_22)) v_main_~s~0_22) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (* (+ 1 v_main_~a~0_22) (+ 1 v_main_~a~0_22)) v_main_~s~0_22)))))) ) not inductive
[2022-04-08 08:05:57,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2022-04-08 08:05:58,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 08:05:58,026 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:109)
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:412)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:154)
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-08 08:05:58,029 INFO L158 Benchmark]: Toolchain (without parser) took 63825.56ms. Allocated memory was 179.3MB in the beginning and 287.3MB in the end (delta: 108.0MB). Free memory was 122.5MB in the beginning and 130.8MB in the end (delta: -8.3MB). Peak memory consumption was 100.5MB. Max. memory is 8.0GB.
[2022-04-08 08:05:58,029 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 179.3MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 08:05:58,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.77ms. Allocated memory was 179.3MB in the beginning and 239.1MB in the end (delta: 59.8MB). Free memory was 122.4MB in the beginning and 208.7MB in the end (delta: -86.3MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB.
[2022-04-08 08:05:58,031 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 239.1MB. Free memory was 208.7MB in the beginning and 207.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-08 08:05:58,031 INFO L158 Benchmark]: RCFGBuilder took 243.17ms. Allocated memory is still 239.1MB. Free memory was 207.1MB in the beginning and 196.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-08 08:05:58,031 INFO L158 Benchmark]: TraceAbstraction took 63362.81ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 196.1MB in the beginning and 130.8MB in the end (delta: 65.3MB). Peak memory consumption was 114.6MB. Max. memory is 8.0GB.
[2022-04-08 08:05:58,032 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.08ms. Allocated memory is still 179.3MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 183.77ms. Allocated memory was 179.3MB in the beginning and 239.1MB in the end (delta: 59.8MB). Free memory was 122.4MB in the beginning and 208.7MB in the end (delta: -86.3MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 31.89ms. Allocated memory is still 239.1MB. Free memory was 208.7MB in the beginning and 207.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 243.17ms. Allocated memory is still 239.1MB. Free memory was 207.1MB in the beginning and 196.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 63362.81ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 196.1MB in the beginning and 130.8MB in the end (delta: 65.3MB). Peak memory consumption was 114.6MB. 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-08 08:05:58,121 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...