/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:00:35,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:00:35,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:00:35,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:00:35,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:00:35,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:00:35,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:00:35,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:00:35,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:00:35,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:00:35,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:00:35,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:00:35,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:00:35,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:00:35,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:00:35,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:00:35,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:00:35,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:00:35,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:00:35,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:00:35,357 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:00:35,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:00:35,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:00:35,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:00:35,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:00:35,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:00:35,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:00:35,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:00:35,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:00:35,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:00:35,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:00:35,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:00:35,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:00:35,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:00:35,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:00:35,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:00:35,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:00:35,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:00:35,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:00:35,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:00:35,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:00:35,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:00:35,367 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:00:35,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:00:35,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:00:35,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:00:35,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:00:35,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:00:35,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:00:35,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:00:35,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:00:35,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:00:35,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:00:35,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:00:35,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:00:35,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:00:35,375 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:00:35,375 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:00:35,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:00:35,375 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:00:35,375 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:00:35,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:00:35,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:00:35,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:00:35,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:00:35,566 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:00:35,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-28 08:00:35,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98364389/f72801c9db2a4e3494746c68483f8450/FLAGc11d52c1e [2022-04-28 08:00:35,914 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:00:35,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-28 08:00:35,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98364389/f72801c9db2a4e3494746c68483f8450/FLAGc11d52c1e [2022-04-28 08:00:36,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98364389/f72801c9db2a4e3494746c68483f8450 [2022-04-28 08:00:36,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:00:36,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:00:36,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:00:36,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:00:36,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:00:36,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de9fb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36, skipping insertion in model container [2022-04-28 08:00:36,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:00:36,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:00:36,463 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_unwindbound20.c[520,533] [2022-04-28 08:00:36,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:00:36,493 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:00:36,501 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_unwindbound20.c[520,533] [2022-04-28 08:00:36,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:00:36,513 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:00:36,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36 WrapperNode [2022-04-28 08:00:36,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:00:36,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:00:36,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:00:36,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:00:36,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:00:36,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:00:36,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:00:36,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:00:36,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (1/1) ... [2022-04-28 08:00:36,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:00:36,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:00:36,572 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:00:36,581 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:00:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:00:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:00:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:00:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 08:00:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 08:00:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:00:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:00:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:00:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:00:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:00:36,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:00:36,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 08:00:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 08:00:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:00:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:00:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:00:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:00:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:00:36,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:00:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:00:36,648 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:00:36,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:00:36,765 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:00:36,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:00:36,769 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:00:36,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:00:36 BoogieIcfgContainer [2022-04-28 08:00:36,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:00:36,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:00:36,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:00:36,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:00:36,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:00:36" (1/3) ... [2022-04-28 08:00:36,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7770c8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:00:36, skipping insertion in model container [2022-04-28 08:00:36,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:00:36" (2/3) ... [2022-04-28 08:00:36,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7770c8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:00:36, skipping insertion in model container [2022-04-28 08:00:36,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:00:36" (3/3) ... [2022-04-28 08:00:36,784 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound20.c [2022-04-28 08:00:36,793 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:00:36,793 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:00:36,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:00:36,853 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@4c35baed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7608649b [2022-04-28 08:00:36,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:00:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 08:00:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 08:00:36,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:00:36,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:00:36,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:00:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:00:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-28 08:00:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:36,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135920358] [2022-04-28 08:00:36,880 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:00:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-28 08:00:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:00:36,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047567550] [2022-04-28 08:00:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:00:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:00:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:00:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:37,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-28 08:00:37,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 08:00:37,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 08:00:37,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:00:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-28 08:00:37,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 08:00:37,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 08:00:37,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-28 08:00:37,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-28 08:00:37,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 08:00:37,029 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-28 08:00:37,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 08:00:37,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 08:00:37,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 08:00:37,031 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:00:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:00:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047567550] [2022-04-28 08:00:37,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047567550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:37,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:37,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:00:37,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:00:37,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135920358] [2022-04-28 08:00:37,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135920358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:37,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:37,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:00:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393977866] [2022-04-28 08:00:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:00:37,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 08:00:37,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:00:37,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:37,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 08:00:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 08:00:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 08:00:37,079 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:37,231 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 08:00:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 08:00:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 08:00:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:00:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 08:00:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 08:00:37,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 08:00:37,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:37,340 INFO L225 Difference]: With dead ends: 47 [2022-04-28 08:00:37,340 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 08:00:37,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 08:00:37,345 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:00:37,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:00:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 08:00:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 08:00:37,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:00:37,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,387 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,388 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:37,392 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 08:00:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 08:00:37,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:37,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:37,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-28 08:00:37,393 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-28 08:00:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:37,398 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 08:00:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 08:00:37,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:37,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:37,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:00:37,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:00:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-28 08:00:37,401 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-28 08:00:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:00:37,402 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-28 08:00:37,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-28 08:00:37,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 08:00:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 08:00:37,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:00:37,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:00:37,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:00:37,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:00:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:00:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-28 08:00:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:37,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469850115] [2022-04-28 08:00:37,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:00:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-28 08:00:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:00:37,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710995806] [2022-04-28 08:00:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:00:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:00:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:00:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:37,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:00:37,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} 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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:00:37,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-28 08:00:37,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {218#false} is VALID [2022-04-28 08:00:37,494 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-28 08:00:37,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-28 08:00:37,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-28 08:00:37,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-28 08:00:37,495 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:00:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:00:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710995806] [2022-04-28 08:00:37,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710995806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:37,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:37,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:00:37,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:00:37,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469850115] [2022-04-28 08:00:37,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469850115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:37,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:37,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:00:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386938601] [2022-04-28 08:00:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:00:37,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 08:00:37,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:00:37,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:00:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:00:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:00:37,507 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:37,617 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 08:00:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:00:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 08:00:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:00:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 08:00:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 08:00:37,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 08:00:37,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:37,663 INFO L225 Difference]: With dead ends: 32 [2022-04-28 08:00:37,663 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 08:00:37,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:00:37,664 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:00:37,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:00:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 08:00:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 08:00:37,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:00:37,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,668 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,669 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:37,670 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 08:00:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 08:00:37,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:37,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:37,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-28 08:00:37,671 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-28 08:00:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:37,673 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 08:00:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 08:00:37,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:37,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:37,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:00:37,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:00:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 08:00:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 08:00:37,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-28 08:00:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:00:37,675 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 08:00:37,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 08:00:37,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 08:00:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 08:00:37,703 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:00:37,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:00:37,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:00:37,704 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:00:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:00:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-28 08:00:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:37,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854421840] [2022-04-28 08:00:37,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:00:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-28 08:00:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:00:37,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953520880] [2022-04-28 08:00:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:00:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:00:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:00:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:37,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-28 08:00:37,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 08:00:37,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 08:00:37,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:00:37,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-28 08:00:37,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 08:00:37,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 08:00:37,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 08:00:37,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 08:00:37,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 08:00:37,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 08:00:37,776 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(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)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 08:00:37,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 08:00:37,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-28 08:00:37,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 08:00:37,777 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:00:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:00:37,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953520880] [2022-04-28 08:00:37,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953520880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:37,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:37,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:00:37,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:00:37,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854421840] [2022-04-28 08:00:37,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854421840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:37,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:37,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:00:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15156823] [2022-04-28 08:00:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:00:37,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 08:00:37,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:00:37,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:37,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:37,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:00:37,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:00:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:00:37,788 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:38,074 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 08:00:38,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 08:00:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 08:00:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:00:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 08:00:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 08:00:38,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 08:00:38,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:38,119 INFO L225 Difference]: With dead ends: 36 [2022-04-28 08:00:38,119 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 08:00:38,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:00:38,121 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:00:38,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:00:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 08:00:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 08:00:38,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:00:38,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:00:38,137 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:00:38,137 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:00:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:38,140 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 08:00:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 08:00:38,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:38,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:38,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 08:00:38,143 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 08:00:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:38,147 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 08:00:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 08:00:38,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:38,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:38,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:00:38,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:00:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:00:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 08:00:38,153 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 08:00:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:00:38,154 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 08:00:38,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:00:38,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 08:00:38,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 08:00:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:00:38,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:00:38,194 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:00:38,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:00:38,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:00:38,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:00:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-28 08:00:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:38,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359657918] [2022-04-28 08:00:38,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:00:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-28 08:00:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:00:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251371737] [2022-04-28 08:00:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:00:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:00:38,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:00:38,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9753863] [2022-04-28 08:00:38,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:00:38,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:00:38,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:00:38,210 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:00:38,217 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:00:38,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:00:38,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:00:38,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:00:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:38,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:00:38,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-28 08:00:38,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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);~counter~0 := 0; {608#true} is VALID [2022-04-28 08:00:38,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 08:00:38,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-28 08:00:38,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-28 08:00:38,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:00:38,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:00:38,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:00:38,409 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-28 08:00:38,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-28 08:00:38,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-28 08:00:38,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 08:00:38,410 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:00:38,410 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(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)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:00:38,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:00:38,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-28 08:00:38,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-28 08:00:38,412 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:00:38,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:00:38,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:00:38,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251371737] [2022-04-28 08:00:38,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:00:38,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9753863] [2022-04-28 08:00:38,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9753863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:38,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:38,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:00:38,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:00:38,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359657918] [2022-04-28 08:00:38,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359657918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:38,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:38,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:00:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217062497] [2022-04-28 08:00:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:00:38,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 08:00:38,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:00:38,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:00:38,424 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:00:38,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:00:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:00:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:00:38,425 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:00:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:38,539 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 08:00:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:00:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 08:00:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:00:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:00:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:00:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:00:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:00:38,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 08:00:38,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:38,578 INFO L225 Difference]: With dead ends: 40 [2022-04-28 08:00:38,578 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 08:00:38,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:00:38,579 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:00:38,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:00:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 08:00:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 08:00:38,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:00:38,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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:00:38,588 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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:00:38,588 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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:00:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:38,589 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:00:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:00:38,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:38,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:38,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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:00:38,590 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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:00:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:38,591 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:00:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:00:38,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:38,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:38,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:00:38,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:00:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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:00:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 08:00:38,593 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-28 08:00:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:00:38,593 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 08:00:38,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:00:38,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 08:00:38,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 08:00:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:00:38,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:00:38,632 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:00:38,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 08:00:38,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:00:38,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:00:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:00:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-28 08:00:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:38,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664992287] [2022-04-28 08:00:38,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:00:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-28 08:00:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:00:38,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950913061] [2022-04-28 08:00:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:00:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:00:38,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:00:38,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111233270] [2022-04-28 08:00:38,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:00:38,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:00:38,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:00:38,865 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:00:38,866 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:00:38,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:00:38,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:00:38,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:00:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:38,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:00:39,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-28 08:00:39,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#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);~counter~0 := 0; {895#true} is VALID [2022-04-28 08:00:39,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 08:00:39,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-28 08:00:39,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-28 08:00:39,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:00:39,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:00:39,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:00:39,011 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-28 08:00:39,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 08:00:39,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 08:00:39,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 08:00:39,011 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:00:39,012 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(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)); {895#true} is VALID [2022-04-28 08:00:39,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 08:00:39,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 08:00:39,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 08:00:39,012 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:00:39,013 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(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)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:00:39,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:00:39,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-28 08:00:39,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-28 08:00:39,014 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:00:39,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:00:39,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:00:39,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950913061] [2022-04-28 08:00:39,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:00:39,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111233270] [2022-04-28 08:00:39,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111233270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:39,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:39,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:00:39,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:00:39,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664992287] [2022-04-28 08:00:39,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664992287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:00:39,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:00:39,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:00:39,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156504139] [2022-04-28 08:00:39,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:00:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:00:39,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:00:39,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:00:39,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:39,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:00:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:00:39,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:00:39,027 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:00:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:39,194 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 08:00:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:00:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:00:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:00:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:00:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:00:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:00:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:00:39,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 08:00:39,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:00:39,240 INFO L225 Difference]: With dead ends: 44 [2022-04-28 08:00:39,240 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 08:00:39,241 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:00:39,242 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:00:39,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:00:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 08:00:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 08:00:39,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:00:39,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 08:00:39,258 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 08:00:39,258 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 08:00:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:39,260 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 08:00:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 08:00:39,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:39,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:39,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-28 08:00:39,261 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-28 08:00:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:00:39,262 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 08:00:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 08:00:39,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:00:39,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:00:39,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:00:39,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:00:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 08:00:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 08:00:39,264 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-28 08:00:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:00:39,264 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 08:00:39,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:00:39,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 08:00:39,301 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:00:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 08:00:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:00:39,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:00:39,302 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:00:39,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 08:00:39,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:00:39,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:00:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:00:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-28 08:00:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:00:39,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062518256] [2022-04-28 08:00:45,759 WARN L232 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 136 DAG size of output: 129 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 08:00:45,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:00:45,789 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:00:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1831963292, now seen corresponding path program 1 times [2022-04-28 08:00:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:00:45,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081793547] [2022-04-28 08:00:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:00:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:00:45,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:00:45,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538251942] [2022-04-28 08:00:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:00:45,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:00:45,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:00:45,824 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:00:45,825 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:00:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:45,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 08:00:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:00:45,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:27,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 08:01:27,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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);~counter~0 := 0; {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:27,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(= ~counter~0 0)} assume true; {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:27,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(= ~counter~0 0)} {1211#true} #66#return; {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:27,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(= ~counter~0 0)} call #t~ret6 := main(); {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:27,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(= ~counter~0 0)} 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;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1232#(and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0))} is VALID [2022-04-28 08:01:27,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {1232#(and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0))} [70] L30-3-->L30-1_primed: Formula: (let ((.cse11 (* 2 v_main_~a~0_19))) (let ((.cse2 (<= v_main_~s~0_20 v_main_~n~0_6)) (.cse8 (< v_~counter~0_9 20)) (.cse3 (= v_main_~t~0_19 (+ .cse11 1))) (.cse6 (= |v_main_#t~post5_8| |v_main_#t~post5_6|)) (.cse7 (= v_main_~a~0_19 v_main_~a~0_18)) (.cse9 (= v_~counter~0_9 v_~counter~0_8)) (.cse10 (= v_main_~t~0_19 v_main_~t~0_18))) (or (let ((.cse1 (div (+ v_~counter~0_9 (* (- 1) v_~counter~0_8)) (- 2)))) (let ((.cse0 (* 2 .cse1))) (and (= (+ .cse0 v_main_~a~0_19) v_main_~a~0_18) (= v_main_~s~0_19 (+ v_main_~s~0_20 (* (* .cse1 .cse1) 4) (* 2 (* v_main_~t~0_19 .cse1)) .cse0)) .cse2 (= v_main_~t~0_18 (+ v_main_~t~0_19 (* .cse1 4))) (= (mod (+ v_~counter~0_9 v_~counter~0_8) 2) 0) .cse3 (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ v_~counter~0_9 (* (- 1) v_~counter~0_8)) (- 2)))) (not (<= 0 v_itHalf_1)) (let ((.cse5 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse4 (* v_itHalf_1 2))) (and (< (+ v_~counter~0_9 .cse4) 19) (<= (+ v_main_~s~0_20 v_main_~t~0_19 2 (* v_itHalf_1 6) .cse5 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (= (+ v_main_~s~0_20 v_main_~t~0_19 .cse5) (+ (* 4 v_main_~a~0_19) (* (* v_itHalf_1 v_main_~a~0_19) 4) 2 (* v_main_~a~0_19 v_main_~a~0_19) .cse4)))))) (< 0 .cse1)))) (and .cse6 .cse7 (or (not .cse2) (not .cse3) (not .cse8) (not (= (* v_main_~s~0_20 4) (+ (* v_main_~t~0_19 v_main_~t~0_19) (* v_main_~t~0_19 2) 1)))) .cse9 .cse10 (= v_main_~s~0_19 v_main_~s~0_20)) (let ((.cse15 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (let ((.cse14 (* .cse15 2))) (and (= (+ (* v_main_~a~0_19 v_main_~a~0_19) .cse11 1) v_main_~s~0_20) .cse2 (= (mod (+ v_main_~t~0_19 (* v_main_~t~0_18 3) 2) 4) 0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (not (<= 1 v_itHalf_1)) (let ((.cse12 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse13 (* v_itHalf_1 2))) (and (= (+ v_main_~s~0_20 .cse12) (+ (* (* v_itHalf_1 v_main_~a~0_19) 4) (* v_main_~a~0_19 v_main_~a~0_19) (* 2 v_main_~a~0_19) .cse13 1)) (<= (+ v_main_~s~0_20 .cse12 .cse13 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (< (+ v_~counter~0_9 .cse13) 20))))) (= (+ .cse14 1 v_main_~a~0_19) v_main_~a~0_18) .cse8 (<= 0 .cse15) .cse3 (= v_main_~s~0_19 (+ v_main_~s~0_20 v_main_~t~0_19 (* (* v_main_~t~0_19 .cse15) 2) 2 (* (* .cse15 .cse15) 4) (* .cse15 6))) (= v_~counter~0_8 (+ .cse14 v_~counter~0_9 1))))) (and (= v_main_~n~0_6 v_main_~n~0_6) .cse6 (= v_main_~s~0_20 v_main_~s~0_19) .cse7 .cse9 .cse10)))) InVars {~counter~0=v_~counter~0_9, main_~t~0=v_main_~t~0_19, main_#t~post5=|v_main_#t~post5_8|, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_20, main_~a~0=v_main_~a~0_19} OutVars{~counter~0=v_~counter~0_8, main_~t~0=v_main_~t~0_18, main_#t~post5=|v_main_#t~post5_6|, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_19, main_~a~0=v_main_~a~0_18} AuxVars[] AssignedVars[~counter~0, main_~t~0, main_#t~post5, main_~s~0, main_~a~0] {1236#(or (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)) (and (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 19) (= (+ 2 (* v_itHalf_1 2)) (+ (* (div (* ~counter~0 (- 1)) (- 2)) (- 4)) main_~s~0 (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2)) (- 4)) (* v_itHalf_1 2) 1)) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4)))) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))))))) (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (< (* v_itHalf_1 2) 20) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))))} is VALID [2022-04-28 08:01:27,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#(or (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)) (and (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (< (* v_itHalf_1 2) 19) (= (+ 2 (* v_itHalf_1 2)) (+ (* (div (* ~counter~0 (- 1)) (- 2)) (- 4)) main_~s~0 (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2)) (- 4)) (* v_itHalf_1 2) 1)) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4)))) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))))))) (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (< (* v_itHalf_1 2) 20) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))))} [69] L30-1_primed-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1240#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (< (* v_itHalf_1 2) 20) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 19) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)))))) (<= |main_#t~post5| (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (= (* 2 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) main_~a~0) (< 0 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (and (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} is VALID [2022-04-28 08:01:27,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1240#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (and (< (* v_itHalf_1 2) 20) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 19) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)))))) (<= |main_#t~post5| (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (= (* 2 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) main_~a~0) (< 0 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (and (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} assume !(#t~post5 < 20);havoc #t~post5; {1244#(and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 19) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)))))) (= main_~a~0 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (<= 20 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))))} is VALID [2022-04-28 08:01:27,434 INFO L272 TraceCheckUtils]: 9: Hoare triple {1244#(and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 19) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1))) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)))))) (= main_~a~0 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (<= 20 (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:01:27,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:27,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 08:01:27,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 08:01:27,435 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:27,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:01:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:27,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081793547] [2022-04-28 08:01:27,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:27,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538251942] [2022-04-28 08:01:27,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538251942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:27,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:27,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 08:02:51,815 WARN L232 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 132 DAG size of output: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 08:02:54,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:02:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062518256] [2022-04-28 08:02:54,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062518256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:02:54,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:02:54,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 08:02:54,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545955327] [2022-04-28 08:02:54,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:02:54,318 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-04-28 08:02:54,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:02:54,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 08:02:54,933 WARN L143 InductivityCheck]: Transition 1262#(and (exists ((v_main_~t~0_22 Int) (v_main_~a~0_22 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_4 Int)) (and (or (and (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1)) (and (not (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))) (or (and (not (= main_~t~0 (+ (* main_~a~0 2) 1))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0)) (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1) (= main_~t~0 (+ (* main_~a~0 2) 1)))) (or (and (= (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1) v_main_~a~0_22) (= (+ ~counter~0 (- 1)) (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1)) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int)) (and (<= 1 v_main_~n~0_BEFORE_RETURN_1) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 20) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) v_main_~n~0_BEFORE_RETURN_1)) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4)))))))) (<= 0 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) (= (mod (+ 3 (* v_main_~t~0_22 3)) 4) 0)) (and (= 0 v_main_~a~0_22) (= (+ ~counter~0 (- 1)) 0) (= v_main_~t~0_22 1)) (and (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~s~0_BEFORE_RETURN_1 Int)) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 19) (= v_main_~s~0_BEFORE_RETURN_1 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4) 1)) (<= (+ 3 v_main_~s~0_BEFORE_RETURN_1 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) v_main_~n~0_BEFORE_RETURN_1 (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4)))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* ~counter~0 (- 1)) 1) (- 2))))))) (= v_main_~t~0_22 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) 1)) (= (mod (+ ~counter~0 1) 2) 0) (= (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 2) v_main_~a~0_22) (< 0 (div (+ (* ~counter~0 (- 1)) 1) (- 2))))))) (< ~counter~0 21)) ( _ , call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); , 1264#(and (< ~counter~0 21) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1)) (exists ((v_main_~t~0_22 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_4 Int) (v_main_~a~0_22 Int)) (and (or (and (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1)) (and (not (= (+ (* 2 v_main_~a~0_22) 1) v_main_~t~0_22)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))) (or (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 1) (= (mod (+ main_~t~0 1) 2) 0)) (and (exists ((v_main_~a~0_23 Int)) (not (= main_~t~0 (+ (* 2 v_main_~a~0_23) 1)))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_4 0))) (or (and (= (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1) v_main_~a~0_22) (= (+ ~counter~0 (- 1)) (+ (* 2 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) 1)) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int)) (and (<= 1 v_main_~n~0_BEFORE_RETURN_1) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 20) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) v_main_~n~0_BEFORE_RETURN_1)) (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4)))))))) (<= 0 (div (+ 3 (* (- 1) v_main_~t~0_22)) (- 4))) (= (mod (+ 3 (* v_main_~t~0_22 3)) 4) 0)) (and (= 0 v_main_~a~0_22) (= (+ ~counter~0 (- 1)) 0) (= v_main_~t~0_22 1)) (and (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~s~0_BEFORE_RETURN_1 Int)) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 19) (= v_main_~s~0_BEFORE_RETURN_1 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4) 1)) (<= (+ 3 v_main_~s~0_BEFORE_RETURN_1 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) v_main_~n~0_BEFORE_RETURN_1 (* (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) (div (+ (* ~counter~0 (- 1)) 1) (- 2))) 4)))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* ~counter~0 (- 1)) 1) (- 2))))))) (= v_main_~t~0_22 (+ (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 4) 1)) (= (mod (+ ~counter~0 1) 2) 0) (= (* (div (+ (* ~counter~0 (- 1)) 1) (- 2)) 2) v_main_~a~0_22) (< 0 (div (+ (* ~counter~0 (- 1)) 1) (- 2)))))))) ) not inductive [2022-04-28 08:02:54,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 08:02:55,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:02:55,134 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(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:55,137 INFO L158 Benchmark]: Toolchain (without parser) took 138797.52ms. Allocated memory was 194.0MB in the beginning and 280.0MB in the end (delta: 86.0MB). Free memory was 144.1MB in the beginning and 151.7MB in the end (delta: -7.7MB). Peak memory consumption was 79.1MB. Max. memory is 8.0GB. [2022-04-28 08:02:55,137 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 194.0MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:02:55,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.61ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 169.0MB in the end (delta: -25.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-28 08:02:55,138 INFO L158 Benchmark]: Boogie Preprocessor took 36.11ms. Allocated memory is still 194.0MB. Free memory was 169.0MB in the beginning and 167.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 08:02:55,138 INFO L158 Benchmark]: RCFGBuilder took 219.61ms. Allocated memory is still 194.0MB. Free memory was 167.2MB in the beginning and 156.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:02:55,138 INFO L158 Benchmark]: TraceAbstraction took 138364.62ms. Allocated memory was 194.0MB in the beginning and 280.0MB in the end (delta: 86.0MB). Free memory was 156.1MB in the beginning and 151.7MB in the end (delta: 4.4MB). Peak memory consumption was 91.0MB. Max. memory is 8.0GB. [2022-04-28 08:02:55,139 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 194.0MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.61ms. Allocated memory is still 194.0MB. Free memory was 143.9MB in the beginning and 169.0MB in the end (delta: -25.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.11ms. Allocated memory is still 194.0MB. Free memory was 169.0MB in the beginning and 167.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 219.61ms. Allocated memory is still 194.0MB. Free memory was 167.2MB in the beginning and 156.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 138364.62ms. Allocated memory was 194.0MB in the beginning and 280.0MB in the end (delta: 86.0MB). Free memory was 156.1MB in the beginning and 151.7MB in the end (delta: 4.4MB). Peak memory consumption was 91.0MB. 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:55,345 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-28 08:02:55,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...