/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_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:01:18,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:01:18,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:01:18,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:01:18,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:01:18,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:01:18,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:01:18,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:01:18,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:01:18,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:01:18,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:01:18,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:01:18,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:01:18,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:01:18,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:01:18,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:01:18,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:01:18,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:01:18,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:01:18,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:01:18,326 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:01:18,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:01:18,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:01:18,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:01:18,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:01:18,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:01:18,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:01:18,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:01:18,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:01:18,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:01:18,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:01:18,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:01:18,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:01:18,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:01:18,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:01:18,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:01:18,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:01:18,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:01:18,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:01:18,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:01:18,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:01:18,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:01:18,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:01:18,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:01:18,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:01:18,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:01:18,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:01:18,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:01:18,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:01:18,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:01:18,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:01:18,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:01:18,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:01:18,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:01:18,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:01:18,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:01:18,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:01:18,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:01:18,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:01:18,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:01:18,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:01:18,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:01:18,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:01:18,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:01:18,369 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:01:18,369 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:01:18,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:01:18,370 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:01:18,370 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-28 08:01:18,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:01:18,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:01:18,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:01:18,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:01:18,615 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:01:18,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound1.c [2022-04-28 08:01:18,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589dc1804/e5940a9493ba46dbab8ee0062fd89214/FLAGa964c3323 [2022-04-28 08:01:18,978 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:01:18,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound1.c [2022-04-28 08:01:18,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589dc1804/e5940a9493ba46dbab8ee0062fd89214/FLAGa964c3323 [2022-04-28 08:01:19,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589dc1804/e5940a9493ba46dbab8ee0062fd89214 [2022-04-28 08:01:19,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:01:19,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:01:19,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:01:19,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:01:19,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:01:19,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3063ceb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19, skipping insertion in model container [2022-04-28 08:01:19,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:01:19,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:01:19,647 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_valuebound1.c[520,533] [2022-04-28 08:01:19,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:01:19,688 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:01:19,710 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_valuebound1.c[520,533] [2022-04-28 08:01:19,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:01:19,741 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:01:19,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19 WrapperNode [2022-04-28 08:01:19,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:01:19,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:01:19,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:01:19,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:01:19,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:01:19,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:01:19,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:01:19,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:01:19,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (1/1) ... [2022-04-28 08:01:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:01:19,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:19,809 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-28 08:01:19,818 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-28 08:01:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:01:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:01:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:01:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 08:01:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 08:01:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:01:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:01:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:01:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:01:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:01:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:01:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:01:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:01:19,896 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:01:19,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:01:20,048 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:01:20,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:01:20,061 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:01:20,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:01:20 BoogieIcfgContainer [2022-04-28 08:01:20,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:01:20,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:01:20,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:01:20,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:01:20,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:01:19" (1/3) ... [2022-04-28 08:01:20,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31759883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:01:20, skipping insertion in model container [2022-04-28 08:01:20,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:19" (2/3) ... [2022-04-28 08:01:20,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31759883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:01:20, skipping insertion in model container [2022-04-28 08:01:20,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:01:20" (3/3) ... [2022-04-28 08:01:20,087 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound1.c [2022-04-28 08:01:20,105 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:01:20,106 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:01:20,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:01:20,156 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bd09dc9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6474b16e [2022-04-28 08:01:20,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:01:20,163 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-28 08:01:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:01:20,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:20,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:01:20,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-28 08:01:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:20,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250309172] [2022-04-28 08:01:20,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-28 08:01:20,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:20,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128171278] [2022-04-28 08:01:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:20,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:01:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:20,364 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-28 08:01:20,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 08:01:20,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 08:01:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:01:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:20,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 08:01:20,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 08:01:20,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 08:01:20,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 08:01:20,381 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-28 08:01:20,381 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-28 08:01:20,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 08:01:20,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 08:01:20,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-28 08:01:20,382 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-28 08:01:20,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {34#true} is VALID [2022-04-28 08:01:20,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 08:01:20,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 08:01:20,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 08:01:20,383 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 08:01:20,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-28 08:01:20,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 08:01:20,384 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-28 08:01:20,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 08:01:20,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 08:01:20,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 08:01:20,385 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-28 08:01:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:20,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128171278] [2022-04-28 08:01:20,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128171278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:20,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:20,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:01:20,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:20,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250309172] [2022-04-28 08:01:20,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250309172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:20,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:20,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:01:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862242011] [2022-04-28 08:01:20,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:20,396 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-28 08:01:20,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:20,400 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-28 08:01:20,421 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-28 08:01:20,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 08:01:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 08:01:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 08:01:20,443 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-28 08:01:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:20,569 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-28 08:01:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 08:01:20,569 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-28 08:01:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:20,571 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-28 08:01:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 08:01:20,579 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-28 08:01:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 08:01:20,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-28 08:01:20,695 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-28 08:01:20,705 INFO L225 Difference]: With dead ends: 53 [2022-04-28 08:01:20,705 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 08:01:20,709 INFO L412 NwaCegarLoop]: 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-28 08:01:20,715 INFO L413 NwaCegarLoop]: 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-28 08:01:20,717 INFO L414 NwaCegarLoop]: 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-28 08:01:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 08:01:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 08:01:20,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:20,750 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-28 08:01:20,751 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-28 08:01:20,751 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-28 08:01:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:20,756 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 08:01:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 08:01:20,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:20,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:20,758 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-28 08:01:20,758 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-28 08:01:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:20,762 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 08:01:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 08:01:20,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:20,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:20,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:20,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:20,771 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-28 08:01:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 08:01:20,775 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 08:01:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:20,775 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 08:01:20,775 INFO L496 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-28 08:01:20,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 08:01:20,812 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-28 08:01:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 08:01:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:01:20,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:20,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:01:20,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:01:20,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-28 08:01:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:20,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135288498] [2022-04-28 08:01:20,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-28 08:01:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:20,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157006406] [2022-04-28 08:01:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:20,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:01:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:20,912 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-28 08:01:20,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:01:20,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 08:01:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:01:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:20,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 08:01:20,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 08:01:20,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:01:20,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 08:01:20,920 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-28 08:01:20,920 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-28 08:01:20,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:01:20,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 08:01:20,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-28 08:01:20,921 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-28 08:01:20,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {256#true} is VALID [2022-04-28 08:01:20,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 08:01:20,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 08:01:20,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:01:20,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 08:01:20,923 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-28 08:01:20,924 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-28 08:01:20,924 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-28 08:01:20,925 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-28 08:01:20,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-28 08:01:20,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 08:01:20,926 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-28 08:01:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:20,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157006406] [2022-04-28 08:01:20,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157006406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:20,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:20,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:01:20,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:20,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135288498] [2022-04-28 08:01:20,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135288498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:20,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:20,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:01:20,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093838900] [2022-04-28 08:01:20,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:20,929 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-28 08:01:20,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:20,930 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-28 08:01:20,944 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-28 08:01:20,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:01:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:20,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:01:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:01:20,945 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-28 08:01:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:21,366 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 08:01:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:01:21,367 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-28 08:01:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:21,367 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-28 08:01:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 08:01:21,371 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-28 08:01:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 08:01:21,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 08:01:21,435 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-28 08:01:21,437 INFO L225 Difference]: With dead ends: 40 [2022-04-28 08:01:21,437 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 08:01:21,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 08:01:21,439 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:01:21,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:01:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 08:01:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-28 08:01:21,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:21,450 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-28 08:01:21,450 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-28 08:01:21,450 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-28 08:01:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:21,453 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:01:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:01:21,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:21,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:21,455 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-28 08:01:21,455 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-28 08:01:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:21,458 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:01:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:01:21,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:21,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:21,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:21,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:21,460 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-28 08:01:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 08:01:21,463 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-28 08:01:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:21,463 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 08:01:21,464 INFO L496 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-28 08:01:21,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 08:01:21,526 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-28 08:01:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 08:01:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:01:21,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:21,527 INFO L195 NwaCegarLoop]: 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-28 08:01:21,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:01:21,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-28 08:01:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:21,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806293053] [2022-04-28 08:01:21,529 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-28 08:01:21,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:21,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626359683] [2022-04-28 08:01:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:21,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:21,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:01:21,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42082735] [2022-04-28 08:01:21,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:01:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:01:21,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:21,547 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-28 08:01:21,595 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-28 08:01:21,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:01:21,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:01:21,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:01:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:21,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:21,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 08:01:21,834 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-28 08:01:21,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 08:01:21,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-28 08:01:21,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-28 08:01:21,835 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-28 08:01:21,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {507#true} is VALID [2022-04-28 08:01:21,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 08:01:21,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 08:01:21,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 08:01:21,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-28 08:01:21,840 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-28 08:01:21,840 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-28 08:01:21,840 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-28 08:01:21,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 08:01:21,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 08:01:21,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 08:01:21,842 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-28 08:01:21,843 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-28 08:01:21,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:21,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 08:01:21,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 08:01:21,844 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-28 08:01:21,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:01:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:21,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626359683] [2022-04-28 08:01:21,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:21,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42082735] [2022-04-28 08:01:21,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42082735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:21,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:21,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:21,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:21,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806293053] [2022-04-28 08:01:21,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806293053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:21,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:21,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:21,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190744420] [2022-04-28 08:01:21,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:21,847 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-28 08:01:21,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:21,848 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-28 08:01:21,866 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-28 08:01:21,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:01:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:21,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:01:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:01:21,867 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-28 08:01:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,022 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 08:01:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:01:22,022 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-28 08:01:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:22,022 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-28 08:01:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:01:22,025 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-28 08:01:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:01:22,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 08:01:22,071 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-28 08:01:22,074 INFO L225 Difference]: With dead ends: 44 [2022-04-28 08:01:22,074 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 08:01:22,074 INFO L412 NwaCegarLoop]: 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-28 08:01:22,075 INFO L413 NwaCegarLoop]: 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-28 08:01:22,076 INFO L414 NwaCegarLoop]: 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-28 08:01:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 08:01:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 08:01:22,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:22,105 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-28 08:01:22,106 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-28 08:01:22,107 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-28 08:01:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,116 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 08:01:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 08:01:22,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:22,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:22,124 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-28 08:01:22,125 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-28 08:01:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,127 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 08:01:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 08:01:22,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:22,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:22,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:22,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:22,129 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-28 08:01:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-28 08:01:22,131 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-28 08:01:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:22,131 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-28 08:01:22,132 INFO L496 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-28 08:01:22,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-28 08:01:22,196 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-28 08:01:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 08:01:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:01:22,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:22,197 INFO L195 NwaCegarLoop]: 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-28 08:01:22,223 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-28 08:01:22,419 WARN L477 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-28 08:01:22,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-28 08:01:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:22,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519937072] [2022-04-28 08:01:22,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-28 08:01:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:22,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61478497] [2022-04-28 08:01:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:22,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:01:22,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506477450] [2022-04-28 08:01:22,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:01:22,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:01:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:22,442 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-28 08:01:22,443 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-28 08:01:22,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:01:22,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:01:22,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:01:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:22,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:22,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 08:01:22,624 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-28 08:01:22,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:01:22,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-28 08:01:22,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 08:01:22,625 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-28 08:01:22,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {833#true} is VALID [2022-04-28 08:01:22,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 08:01:22,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 08:01:22,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:01:22,626 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-28 08:01:22,627 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-28 08:01:22,627 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-28 08:01:22,627 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-28 08:01:22,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 08:01:22,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 08:01:22,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:01:22,628 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-28 08:01:22,628 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-28 08:01:22,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 08:01:22,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 08:01:22,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:01:22,630 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-28 08:01:22,631 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-28 08:01:22,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:22,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 08:01:22,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 08:01:22,632 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-28 08:01:22,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:01:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:22,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61478497] [2022-04-28 08:01:22,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:22,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506477450] [2022-04-28 08:01:22,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506477450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:22,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:22,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:22,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519937072] [2022-04-28 08:01:22,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519937072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:22,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:22,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:22,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775556603] [2022-04-28 08:01:22,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:22,635 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-28 08:01:22,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:22,635 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-28 08:01:22,654 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-28 08:01:22,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:01:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:01:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:01:22,656 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-28 08:01:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,823 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 08:01:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:01:22,823 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-28 08:01:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:22,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-28 08:01:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:01:22,830 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-28 08:01:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:01:22,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 08:01:22,880 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-28 08:01:22,881 INFO L225 Difference]: With dead ends: 48 [2022-04-28 08:01:22,881 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 08:01:22,882 INFO L412 NwaCegarLoop]: 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-28 08:01:22,882 INFO L413 NwaCegarLoop]: 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-28 08:01:22,883 INFO L414 NwaCegarLoop]: 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-28 08:01:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 08:01:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 08:01:22,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:22,898 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-28 08:01:22,899 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-28 08:01:22,899 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-28 08:01:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,901 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 08:01:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 08:01:22,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:22,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:22,902 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-28 08:01:22,902 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-28 08:01:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,908 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 08:01:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 08:01:22,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:22,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:22,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:22,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:22,910 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-28 08:01:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 08:01:22,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-28 08:01:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:22,913 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 08:01:22,914 INFO L496 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-28 08:01:22,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 08:01:22,960 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-28 08:01:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 08:01:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:01:22,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:22,961 INFO L195 NwaCegarLoop]: 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-28 08:01:22,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 08:01:23,163 WARN L477 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-28 08:01:23,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-28 08:01:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:23,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505507112] [2022-04-28 08:01:28,949 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-28 08:01:28,954 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:01:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1589942244, now seen corresponding path program 1 times [2022-04-28 08:01:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:28,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264836671] [2022-04-28 08:01:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:28,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:01:28,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898340381] [2022-04-28 08:01:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:28,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:01:28,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:28,981 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-28 08:01:29,006 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-28 08:01:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:29,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 08:01:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:29,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:30,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 08:01:30,058 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-28 08:01:30,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 08:01:30,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 08:01:30,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 08:01:30,058 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-28 08:01:30,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {1188#true} is VALID [2022-04-28 08:01:30,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1214#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 08:01:30,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {1214#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1218#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 08:01:30,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {1218#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1218#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 08:01:30,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1218#(not (= |assume_abort_if_not_#in~cond| 0))} {1188#true} #55#return; {1225#(and (<= 0 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 08:01:30,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#(and (<= 0 main_~n~0) (<= main_~n~0 1))} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1229#(and (= main_~a~0 0) (<= 1 main_~s~0) (= main_~t~0 1) (<= 0 main_~n~0) (<= main_~n~0 1))} is VALID [2022-04-28 08:01:30,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(and (= main_~a~0 0) (<= 1 main_~s~0) (= main_~t~0 1) (<= 0 main_~n~0) (<= main_~n~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] {1233#(or (and (= main_~a~0 0) (= main_~t~0 1)) (and (< (div (+ (- 1) main_~a~0) 2) 1) (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID [2022-04-28 08:01:30,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(or (and (= main_~a~0 0) (= main_~t~0 1)) (and (< (div (+ (- 1) main_~a~0) 2) 1) (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (= (mod (+ main_~a~0 1) 2) 0)))} [72] L31_primed-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1233#(or (and (= main_~a~0 0) (= main_~t~0 1)) (and (< (div (+ (- 1) main_~a~0) 2) 1) (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID [2022-04-28 08:01:30,073 INFO L272 TraceCheckUtils]: 14: Hoare triple {1233#(or (and (= main_~a~0 0) (= main_~t~0 1)) (and (< (div (+ (- 1) main_~a~0) 2) 1) (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (= (mod (+ main_~a~0 1) 2) 0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1240#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:01:30,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {1240#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1244#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:30,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {1244#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 08:01:30,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 08:01:30,074 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-28 08:01:30,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:01:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:30,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264836671] [2022-04-28 08:01:30,075 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:30,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898340381] [2022-04-28 08:01:30,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898340381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:30,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:30,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 08:02:10,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:02:10,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505507112] [2022-04-28 08:02:10,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505507112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:02:10,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:02:10,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 08:02:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476740498] [2022-04-28 08:02:10,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:02:10,921 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 13 states have internal predecessors, (22), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2022-04-28 08:02:10,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:02:10,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 13 states have internal predecessors, (22), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 08:02:12,937 WARN L143 InductivityCheck]: Transition 1262#(and (<= main_~s~0 (+ main_~n~0 main_~t~0)) (= (+ (* main_~s~0 4) (* main_~t~0 (- 4))) (+ (- 3) (* main_~t~0 2) (* (+ (- 2) main_~t~0) (+ (- 2) main_~t~0))))) ( _ , assume !false; , 1233#(or (and (= main_~a~0 0) (= main_~t~0 1)) (and (< (div (+ (- 1) main_~a~0) 2) 1) (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (= (mod (+ main_~a~0 1) 2) 0))) ) not inductive [2022-04-28 08:02:12,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 08:02:13,137 WARN L477 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-28 08:02:13,138 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 08:02:13,141 INFO L158 Benchmark]: Toolchain (without parser) took 53733.53ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 130.7MB in the beginning and 163.8MB in the end (delta: -33.1MB). Peak memory consumption was 4.4MB. Max. memory is 8.0GB. [2022-04-28 08:02:13,142 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 179.3MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:02:13,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.73ms. Allocated memory is still 179.3MB. Free memory was 130.5MB in the beginning and 157.5MB in the end (delta: -27.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-04-28 08:02:13,142 INFO L158 Benchmark]: Boogie Preprocessor took 36.56ms. Allocated memory is still 179.3MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 08:02:13,143 INFO L158 Benchmark]: RCFGBuilder took 281.04ms. Allocated memory is still 179.3MB. Free memory was 156.0MB in the beginning and 145.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:02:13,143 INFO L158 Benchmark]: TraceAbstraction took 53061.99ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 144.9MB in the beginning and 163.8MB in the end (delta: -18.8MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2022-04-28 08:02:13,145 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.15ms. Allocated memory is still 179.3MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 331.73ms. Allocated memory is still 179.3MB. Free memory was 130.5MB in the beginning and 157.5MB in the end (delta: -27.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.56ms. Allocated memory is still 179.3MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 281.04ms. Allocated memory is still 179.3MB. Free memory was 156.0MB in the beginning and 145.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 53061.99ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 144.9MB in the beginning and 163.8MB in the end (delta: -18.8MB). Peak memory consumption was 18.3MB. 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-28 08:02:13,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...