/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/geo1-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:12:51,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:12:51,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:12:51,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:12:51,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:12:51,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:12:51,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:12:51,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:12:51,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:12:51,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:12:51,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:12:51,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:12:51,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:12:51,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:12:51,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:12:51,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:12:51,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:12:51,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:12:51,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:12:51,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:12:51,077 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:12:51,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:12:51,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:12:51,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:12:51,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:12:51,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:12:51,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:12:51,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:12:51,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:12:51,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:12:51,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:12:51,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:12:51,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:12:51,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:12:51,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:12:51,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:12:51,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:12:51,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:12:51,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:12:51,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:12:51,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:12:51,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:12:51,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:12:51,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:12:51,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:12:51,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:12:51,105 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:12:51,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:12:51,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:12:51,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:12:51,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:12:51,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:12:51,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:12:51,106 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:12:51,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:12:51,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:12:51,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:12:51,107 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:12:51,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:12:51,108 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:12:51,108 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 06:12:51,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:12:51,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:12:51,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:12:51,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:12:51,319 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:12:51,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound50.c [2022-04-08 06:12:51,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a73b409/dbd1a796a2a94e979296924724299f1c/FLAGdf41b53d4 [2022-04-08 06:12:51,750 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:12:51,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_valuebound50.c [2022-04-08 06:12:51,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a73b409/dbd1a796a2a94e979296924724299f1c/FLAGdf41b53d4 [2022-04-08 06:12:51,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a73b409/dbd1a796a2a94e979296924724299f1c [2022-04-08 06:12:51,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:12:51,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:12:51,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:12:51,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:12:51,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:12:51,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:51,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66741811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51, skipping insertion in model container [2022-04-08 06:12:51,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:51,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:12:51,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:12:51,932 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/geo1-ll_valuebound50.c[546,559] [2022-04-08 06:12:51,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:12:51,959 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:12:51,967 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/geo1-ll_valuebound50.c[546,559] [2022-04-08 06:12:51,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:12:51,986 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:12:51,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51 WrapperNode [2022-04-08 06:12:51,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:12:51,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:12:51,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:12:51,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:12:51,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:51,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:51,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:51,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:52,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:52,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:52,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:52,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:12:52,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:12:52,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:12:52,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:12:52,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (1/1) ... [2022-04-08 06:12:52,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:12:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:12:52,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 06:12:52,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 06:12:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:12:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:12:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:12:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:12:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:12:52,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:12:52,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:12:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:12:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:12:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:12:52,121 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:12:52,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:12:52,221 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:12:52,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:12:52,226 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 06:12:52,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:12:52 BoogieIcfgContainer [2022-04-08 06:12:52,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:12:52,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:12:52,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:12:52,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:12:52,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:12:51" (1/3) ... [2022-04-08 06:12:52,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523b9bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:12:52, skipping insertion in model container [2022-04-08 06:12:52,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:12:51" (2/3) ... [2022-04-08 06:12:52,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523b9bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:12:52, skipping insertion in model container [2022-04-08 06:12:52,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:12:52" (3/3) ... [2022-04-08 06:12:52,232 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound50.c [2022-04-08 06:12:52,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:12:52,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:12:52,259 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:12:52,264 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 06:12:52,264 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:12:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:12:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 06:12:52,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:12:52,281 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:12:52,281 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:12:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:12:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 774216096, now seen corresponding path program 1 times [2022-04-08 06:12:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:52,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1405868303] [2022-04-08 06:12:52,297 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:12:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash 774216096, now seen corresponding path program 2 times [2022-04-08 06:12:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:12:52,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536197805] [2022-04-08 06:12:52,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:12:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:12:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:12:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:52,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 06:12:52,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 06:12:52,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-08 06:12:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:12:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:52,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-08 06:12:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:12:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:52,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-08 06:12:52,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:12:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:52,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-08 06:12:52,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 06:12:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:52,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-08 06:12:52,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:12:52,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 06:12:52,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 06:12:52,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #68#return; {35#true} is VALID [2022-04-08 06:12:52,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-08 06:12:52,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-08 06:12:52,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-08 06:12:52,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #56#return; {36#false} is VALID [2022-04-08 06:12:52,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-08 06:12:52,487 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-08 06:12:52,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,489 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #58#return; {36#false} is VALID [2022-04-08 06:12:52,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-08 06:12:52,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,490 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #60#return; {36#false} is VALID [2022-04-08 06:12:52,491 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-08 06:12:52,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:12:52,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:12:52,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:12:52,492 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2022-04-08 06:12:52,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {36#false} is VALID [2022-04-08 06:12:52,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 06:12:52,493 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {36#false} is VALID [2022-04-08 06:12:52,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 06:12:52,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 06:12:52,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 06:12:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:12:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:12:52,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536197805] [2022-04-08 06:12:52,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536197805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:52,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:52,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:12:52,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:12:52,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1405868303] [2022-04-08 06:12:52,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1405868303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:52,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:52,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:12:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837332493] [2022-04-08 06:12:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:12:52,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:12:52,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:12:52,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:12:52,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:52,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 06:12:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 06:12:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:12:52,578 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:12:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:52,720 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-08 06:12:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 06:12:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:12:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:12:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:12:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-08 06:12:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:12:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-08 06:12:52,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-08 06:12:52,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:52,845 INFO L225 Difference]: With dead ends: 57 [2022-04-08 06:12:52,846 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 06:12:52,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:12:52,850 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:12:52,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:12:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 06:12:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 06:12:52,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:12:52,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:12:52,872 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:12:52,872 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:12:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:52,875 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 06:12:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 06:12:52,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:52,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:52,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-08 06:12:52,876 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-08 06:12:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:52,878 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 06:12:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 06:12:52,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:52,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:52,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:12:52,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:12:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:12:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 06:12:52,882 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-04-08 06:12:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:12:52,882 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 06:12:52,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:12:52,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 06:12:52,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 06:12:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 06:12:52,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:12:52,914 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:12:52,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 06:12:52,914 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:12:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:12:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1105237916, now seen corresponding path program 1 times [2022-04-08 06:12:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:52,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519147839] [2022-04-08 06:12:52,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:12:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1105237916, now seen corresponding path program 2 times [2022-04-08 06:12:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:12:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486184665] [2022-04-08 06:12:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:12:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:12:52,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:12:52,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433904693] [2022-04-08 06:12:52,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:12:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:12:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:12:52,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:12:53,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 06:12:53,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:12:53,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:12:53,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:12:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:53,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:12:53,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2022-04-08 06:12:53,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#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(10, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-08 06:12:53,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:12:53,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #68#return; {281#true} is VALID [2022-04-08 06:12:53,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-08 06:12:53,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {281#true} is VALID [2022-04-08 06:12:53,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {281#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 50 then 1 else 0)); {281#true} is VALID [2022-04-08 06:12:53,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:12:53,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:12:53,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:12:53,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {281#true} {281#true} #56#return; {281#true} is VALID [2022-04-08 06:12:53,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {281#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {281#true} is VALID [2022-04-08 06:12:53,178 INFO L272 TraceCheckUtils]: 12: Hoare triple {281#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {281#true} is VALID [2022-04-08 06:12:53,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:12:53,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:12:53,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:12:53,179 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {281#true} {281#true} #58#return; {281#true} is VALID [2022-04-08 06:12:53,179 INFO L272 TraceCheckUtils]: 17: Hoare triple {281#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {281#true} is VALID [2022-04-08 06:12:53,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:12:53,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:12:53,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:12:53,180 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {281#true} {281#true} #60#return; {281#true} is VALID [2022-04-08 06:12:53,180 INFO L272 TraceCheckUtils]: 22: Hoare triple {281#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {281#true} is VALID [2022-04-08 06:12:53,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:12:53,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:12:53,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:12:53,180 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {281#true} {281#true} #62#return; {281#true} is VALID [2022-04-08 06:12:53,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {281#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 06:12:53,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} assume !false; {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 06:12:53,183 INFO L272 TraceCheckUtils]: 29: Hoare triple {367#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:12:53,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:12:53,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {282#false} is VALID [2022-04-08 06:12:53,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-08 06:12:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:12:53,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:12:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:12:53,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486184665] [2022-04-08 06:12:53,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:12:53,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433904693] [2022-04-08 06:12:53,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433904693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:53,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:53,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:12:53,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:12:53,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519147839] [2022-04-08 06:12:53,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519147839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:53,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:53,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:12:53,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039160020] [2022-04-08 06:12:53,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:12:53,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 06:12:53,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:12:53,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:12:53,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:53,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:12:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:53,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:12:53,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:12:53,207 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:12:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:53,301 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-08 06:12:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:12:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 06:12:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:12:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:12:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-08 06:12:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:12:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-08 06:12:53,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-08 06:12:53,332 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-08 06:12:53,333 INFO L225 Difference]: With dead ends: 37 [2022-04-08 06:12:53,333 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 06:12:53,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:12:53,334 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:12:53,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:12:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 06:12:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-08 06:12:53,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:12:53,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:12:53,342 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:12:53,342 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:12:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:53,344 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 06:12:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-08 06:12:53,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:53,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:53,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-08 06:12:53,345 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-08 06:12:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:53,346 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 06:12:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-08 06:12:53,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:53,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:53,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:12:53,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:12:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:12:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-08 06:12:53,348 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33 [2022-04-08 06:12:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:12:53,349 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-08 06:12:53,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:12:53,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-08 06:12:53,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 06:12:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 06:12:53,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:12:53,381 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:12:53,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 06:12:53,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:12:53,597 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:12:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:12:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1493430927, now seen corresponding path program 1 times [2022-04-08 06:12:53,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:53,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529747583] [2022-04-08 06:12:53,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:12:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1493430927, now seen corresponding path program 2 times [2022-04-08 06:12:53,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:12:53,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206624145] [2022-04-08 06:12:53,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:12:53,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:12:53,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:12:53,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988481586] [2022-04-08 06:12:53,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:12:53,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:12:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:12:53,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:12:53,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 06:12:53,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:12:53,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:12:53,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 06:12:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:53,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:12:56,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-08 06:12:56,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#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(10, 2);call #Ultimate.allocInit(12, 3); {596#true} is VALID [2022-04-08 06:12:56,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:12:56,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #68#return; {596#true} is VALID [2022-04-08 06:12:56,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-08 06:12:56,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {596#true} is VALID [2022-04-08 06:12:56,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 50 then 1 else 0)); {596#true} is VALID [2022-04-08 06:12:56,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:12:56,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:12:56,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:12:56,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #56#return; {596#true} is VALID [2022-04-08 06:12:56,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {596#true} is VALID [2022-04-08 06:12:56,130 INFO L272 TraceCheckUtils]: 12: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {596#true} is VALID [2022-04-08 06:12:56,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:12:56,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:12:56,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:12:56,131 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {596#true} {596#true} #58#return; {596#true} is VALID [2022-04-08 06:12:56,131 INFO L272 TraceCheckUtils]: 17: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-08 06:12:56,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:12:56,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:12:56,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:12:56,131 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {596#true} {596#true} #60#return; {596#true} is VALID [2022-04-08 06:12:56,132 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-08 06:12:56,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:12:56,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:12:56,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:12:56,132 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {596#true} {596#true} #62#return; {596#true} is VALID [2022-04-08 06:12:56,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {596#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {596#true} is VALID [2022-04-08 06:12:56,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {596#true} assume !false; {596#true} is VALID [2022-04-08 06:12:56,132 INFO L272 TraceCheckUtils]: 29: Hoare triple {596#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {596#true} is VALID [2022-04-08 06:12:56,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {596#true} ~cond := #in~cond; {691#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:12:56,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {691#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:12:56,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:12:56,134 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} {596#true} #64#return; {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 06:12:56,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 06:12:56,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {709#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-08 06:12:56,147 INFO L272 TraceCheckUtils]: 36: Hoare triple {709#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:12:56,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:12:56,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-08 06:12:56,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-08 06:12:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:12:56,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:13:00,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-08 06:13:00,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-08 06:13:00,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:13:00,428 INFO L272 TraceCheckUtils]: 36: Hoare triple {733#(= (+ main_~x~0 1) main_~y~0)} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:13:00,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {733#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-08 06:13:00,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 06:13:00,430 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} {596#true} #64#return; {702#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 06:13:00,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {695#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:13:00,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {752#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {695#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:13:00,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {596#true} ~cond := #in~cond; {752#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:13:00,433 INFO L272 TraceCheckUtils]: 29: Hoare triple {596#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {596#true} is VALID [2022-04-08 06:13:00,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {596#true} assume !false; {596#true} is VALID [2022-04-08 06:13:00,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {596#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {596#true} is VALID [2022-04-08 06:13:00,435 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {596#true} {596#true} #62#return; {596#true} is VALID [2022-04-08 06:13:00,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:13:00,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:13:00,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:13:00,436 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-08 06:13:00,436 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {596#true} {596#true} #60#return; {596#true} is VALID [2022-04-08 06:13:00,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:13:00,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:13:00,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:13:00,436 INFO L272 TraceCheckUtils]: 17: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-08 06:13:00,436 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {596#true} {596#true} #58#return; {596#true} is VALID [2022-04-08 06:13:00,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:13:00,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:13:00,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:13:00,437 INFO L272 TraceCheckUtils]: 12: Hoare triple {596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 50 then 1 else 0)); {596#true} is VALID [2022-04-08 06:13:00,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {596#true} is VALID [2022-04-08 06:13:00,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #56#return; {596#true} is VALID [2022-04-08 06:13:00,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:13:00,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-08 06:13:00,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-08 06:13:00,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 50 then 1 else 0)); {596#true} is VALID [2022-04-08 06:13:00,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {596#true} is VALID [2022-04-08 06:13:00,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-08 06:13:00,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #68#return; {596#true} is VALID [2022-04-08 06:13:00,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-08 06:13:00,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#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(10, 2);call #Ultimate.allocInit(12, 3); {596#true} is VALID [2022-04-08 06:13:00,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-08 06:13:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:13:00,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:00,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206624145] [2022-04-08 06:13:00,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:13:00,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988481586] [2022-04-08 06:13:00,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988481586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:13:00,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:13:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 06:13:00,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529747583] [2022-04-08 06:13:00,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529747583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:00,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:00,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:13:00,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665070002] [2022-04-08 06:13:00,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:00,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-08 06:13:00,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:00,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:13:00,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:00,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:13:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:13:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:13:00,485 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:13:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:00,716 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-08 06:13:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:13:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-08 06:13:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:13:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 06:13:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:13:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 06:13:00,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-08 06:13:00,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:00,777 INFO L225 Difference]: With dead ends: 33 [2022-04-08 06:13:00,778 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 06:13:00,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:13:00,779 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:13:00,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 123 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-04-08 06:13:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 06:13:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 06:13:00,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:00,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:13:00,780 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:13:00,780 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:13:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:00,780 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 06:13:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:13:00,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:00,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:00,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 06:13:00,780 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 06:13:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:00,781 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 06:13:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:13:00,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:00,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:00,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:00,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:13:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 06:13:00,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-04-08 06:13:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:00,781 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 06:13:00,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:13:00,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 06:13:00,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:13:00,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:00,784 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 06:13:00,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 06:13:00,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 06:13:01,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 06:13:01,107 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-08 06:13:01,107 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-08 06:13:01,107 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point L13-2(lines 12 14) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 52) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0))))) [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 52) the Hoare annotation is: true [2022-04-08 06:13:01,108 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-08 06:13:01,109 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 52) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-08 06:13:01,109 INFO L878 garLoopResultBuilder]: At program point L37-1(lines 36 46) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 06:13:01,109 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 06:13:01,110 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 06:13:01,110 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 06:13:01,110 INFO L878 garLoopResultBuilder]: At program point L17(lines 17 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 06:13:01,110 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 06:13:01,110 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-08 06:13:01,110 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 06:13:01,110 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 06:13:01,110 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 06:13:01,112 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 06:13:01,113 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 06:13:01,116 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 06:13:01,117 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 06:13:01,135 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 06:13:01,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 06:13:01 BoogieIcfgContainer [2022-04-08 06:13:01,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 06:13:01,143 INFO L158 Benchmark]: Toolchain (without parser) took 9368.88ms. Allocated memory was 219.2MB in the beginning and 267.4MB in the end (delta: 48.2MB). Free memory was 195.2MB in the beginning and 93.8MB in the end (delta: 101.4MB). Peak memory consumption was 149.5MB. Max. memory is 8.0GB. [2022-04-08 06:13:01,144 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory is still 181.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 06:13:01,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.64ms. Allocated memory is still 219.2MB. Free memory was 195.2MB in the beginning and 192.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-08 06:13:01,144 INFO L158 Benchmark]: Boogie Preprocessor took 28.44ms. Allocated memory is still 219.2MB. Free memory was 192.2MB in the beginning and 190.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 06:13:01,144 INFO L158 Benchmark]: RCFGBuilder took 211.16ms. Allocated memory is still 219.2MB. Free memory was 190.7MB in the beginning and 179.7MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 06:13:01,144 INFO L158 Benchmark]: TraceAbstraction took 8914.16ms. Allocated memory was 219.2MB in the beginning and 267.4MB in the end (delta: 48.2MB). Free memory was 179.4MB in the beginning and 93.8MB in the end (delta: 85.6MB). Peak memory consumption was 134.5MB. Max. memory is 8.0GB. [2022-04-08 06:13:01,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory is still 181.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.64ms. Allocated memory is still 219.2MB. Free memory was 195.2MB in the beginning and 192.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.44ms. Allocated memory is still 219.2MB. Free memory was 192.2MB in the beginning and 190.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 211.16ms. Allocated memory is still 219.2MB. Free memory was 190.7MB in the beginning and 179.7MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8914.16ms. Allocated memory was 219.2MB in the beginning and 267.4MB in the end (delta: 48.2MB). Free memory was 179.4MB in the beginning and 93.8MB in the end (delta: 85.6MB). Peak memory consumption was 134.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 174 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 81 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 80 PreInvPairs, 113 NumberOfFragments, 114 HoareAnnotationTreeSize, 80 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 32 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: z * x + 1 == y + x - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-08 06:13:01,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...