/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:45:08,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:45:08,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:45:08,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:45:08,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:45:08,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:45:08,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:45:08,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:45:08,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:45:08,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:45:08,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:45:08,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:45:08,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:45:08,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:45:08,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:45:08,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:45:08,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:45:08,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:45:08,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:45:08,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:45:08,871 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:45:08,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:45:08,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:45:08,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:45:08,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:45:08,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:45:08,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:45:08,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:45:08,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:45:08,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:45:08,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:45:08,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:45:08,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:45:08,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:45:08,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:45:08,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:45:08,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:45:08,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:45:08,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:45:08,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:45:08,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:45:08,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:45:08,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:45:08,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:45:08,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:45:08,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:45:08,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:45:08,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:45:08,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:45:08,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:45:08,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:45:08,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:45:08,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:45:08,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:45:08,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:45:08,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:45:08,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:45:08,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:45:08,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:45:08,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:45:08,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:45:08,912 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:45:08,912 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:45:08,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:45:08,912 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:45:08,912 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 12:45:09,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:45:09,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:45:09,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:45:09,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:45:09,137 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:45:09,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound2.c [2022-04-28 12:45:09,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4733459/1f2ebd8a083e47c99ad946b00d232c90/FLAG756693408 [2022-04-28 12:45:09,477 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:45:09,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound2.c [2022-04-28 12:45:09,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4733459/1f2ebd8a083e47c99ad946b00d232c90/FLAG756693408 [2022-04-28 12:45:09,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4733459/1f2ebd8a083e47c99ad946b00d232c90 [2022-04-28 12:45:09,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:45:09,925 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:45:09,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:45:09,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:45:09,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:45:09,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:45:09" (1/1) ... [2022-04-28 12:45:09,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4382b15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:09, skipping insertion in model container [2022-04-28 12:45:09,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:45:09" (1/1) ... [2022-04-28 12:45:09,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:45:09,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:45:10,093 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_unwindbound2.c[546,559] [2022-04-28 12:45:10,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:45:10,125 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:45:10,135 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_unwindbound2.c[546,559] [2022-04-28 12:45:10,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:45:10,156 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:45:10,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10 WrapperNode [2022-04-28 12:45:10,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:45:10,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:45:10,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:45:10,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:45:10,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:45:10,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:45:10,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:45:10,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:45:10,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (1/1) ... [2022-04-28 12:45:10,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:45:10,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:45:10,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 12:45:10,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 12:45:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:45:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:45:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:45:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:45:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:45:10,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:45:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:45:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:45:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:45:10,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:45:10,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:45:10,284 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:45:10,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:45:10,391 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:45:10,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:45:10,395 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 12:45:10,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:45:10 BoogieIcfgContainer [2022-04-28 12:45:10,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:45:10,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:45:10,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:45:10,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:45:10,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:45:09" (1/3) ... [2022-04-28 12:45:10,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187e837e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:45:10, skipping insertion in model container [2022-04-28 12:45:10,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:45:10" (2/3) ... [2022-04-28 12:45:10,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187e837e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:45:10, skipping insertion in model container [2022-04-28 12:45:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:45:10" (3/3) ... [2022-04-28 12:45:10,413 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound2.c [2022-04-28 12:45:10,422 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:45:10,422 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:45:10,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:45:10,451 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ffdab99, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@570c2cd3 [2022-04-28 12:45:10,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:45:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 12:45:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:45:10,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:45:10,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:45:10,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:45:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:45:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 730417173, now seen corresponding path program 1 times [2022-04-28 12:45:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:10,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698153442] [2022-04-28 12:45:10,502 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:45:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash 730417173, now seen corresponding path program 2 times [2022-04-28 12:45:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:45:10,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869873277] [2022-04-28 12:45:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:45:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:45:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:45:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:10,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 12:45:10,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 12:45:10,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-28 12:45:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:45:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:10,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 12:45:10,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 12:45:10,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 12:45:10,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-28 12:45:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 12:45:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:10,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 12:45:10,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 12:45:10,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 12:45:10,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-28 12:45:10,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:45:10,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 12:45:10,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 12:45:10,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-28 12:45:10,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 12:45:10,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-28 12:45:10,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {33#true} is VALID [2022-04-28 12:45:10,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 12:45:10,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 12:45:10,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 12:45:10,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-28 12:45:10,739 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {33#true} is VALID [2022-04-28 12:45:10,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 12:45:10,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 12:45:10,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 12:45:10,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-28 12:45:10,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {34#false} is VALID [2022-04-28 12:45:10,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34#false} is VALID [2022-04-28 12:45:10,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} assume !!(#t~post6 < 2);havoc #t~post6; {34#false} is VALID [2022-04-28 12:45:10,741 INFO L272 TraceCheckUtils]: 19: Hoare triple {34#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {34#false} is VALID [2022-04-28 12:45:10,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 12:45:10,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 12:45:10,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 12:45:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:45:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:45:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869873277] [2022-04-28 12:45:10,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869873277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:10,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:10,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:45:10,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:45:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698153442] [2022-04-28 12:45:10,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698153442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:10,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:10,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:45:10,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843751350] [2022-04-28 12:45:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:45:10,753 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:45:10,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:45:10,757 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:10,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:10,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:45:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:45:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:45:10,807 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:10,940 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-04-28 12:45:10,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:45:10,941 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:45:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:45:10,942 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 12:45:10,954 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 12:45:10,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 12:45:11,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:11,052 INFO L225 Difference]: With dead ends: 54 [2022-04-28 12:45:11,053 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 12:45:11,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:45:11,057 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:45:11,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:45:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 12:45:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 12:45:11,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:45:11,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:45:11,094 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:45:11,095 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:45:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:11,108 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 12:45:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 12:45:11,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:11,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:11,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 12:45:11,122 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 12:45:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:11,124 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 12:45:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 12:45:11,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:11,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:11,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:45:11,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:45:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 12:45:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 12:45:11,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2022-04-28 12:45:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:45:11,132 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 12:45:11,132 INFO L496 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:11,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 12:45:11,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 12:45:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:45:11,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:45:11,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:45:11,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:45:11,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:45:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:45:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash -942473515, now seen corresponding path program 1 times [2022-04-28 12:45:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:11,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1216054223] [2022-04-28 12:45:11,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:45:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash -942473515, now seen corresponding path program 2 times [2022-04-28 12:45:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:45:11,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251587986] [2022-04-28 12:45:11,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:45:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:45:11,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:45:11,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686103797] [2022-04-28 12:45:11,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:45:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:45:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:45:11,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:45:11,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 12:45:11,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:45:11,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:45:11,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:45:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:11,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:45:11,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2022-04-28 12:45:11,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#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);~counter~0 := 0; {259#true} is VALID [2022-04-28 12:45:11,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#true} assume true; {259#true} is VALID [2022-04-28 12:45:11,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#true} {259#true} #62#return; {259#true} is VALID [2022-04-28 12:45:11,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#true} call #t~ret7 := main(); {259#true} is VALID [2022-04-28 12:45:11,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {259#true} is VALID [2022-04-28 12:45:11,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {259#true} is VALID [2022-04-28 12:45:11,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#true} ~cond := #in~cond; {259#true} is VALID [2022-04-28 12:45:11,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#true} assume !(0 == ~cond); {259#true} is VALID [2022-04-28 12:45:11,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#true} assume true; {259#true} is VALID [2022-04-28 12:45:11,451 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {259#true} {259#true} #54#return; {259#true} is VALID [2022-04-28 12:45:11,451 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {259#true} is VALID [2022-04-28 12:45:11,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#true} ~cond := #in~cond; {259#true} is VALID [2022-04-28 12:45:11,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#true} assume !(0 == ~cond); {259#true} is VALID [2022-04-28 12:45:11,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#true} assume true; {259#true} is VALID [2022-04-28 12:45:11,451 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {259#true} {259#true} #56#return; {259#true} is VALID [2022-04-28 12:45:11,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {312#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 12:45:11,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {312#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {312#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 12:45:11,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {312#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {312#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 12:45:11,453 INFO L272 TraceCheckUtils]: 19: Hoare triple {312#(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)); {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:45:11,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:45:11,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {260#false} is VALID [2022-04-28 12:45:11,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#false} assume !false; {260#false} is VALID [2022-04-28 12:45:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:45:11,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:45:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:45:11,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251587986] [2022-04-28 12:45:11,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:45:11,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686103797] [2022-04-28 12:45:11,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686103797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:11,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:11,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:45:11,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:45:11,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1216054223] [2022-04-28 12:45:11,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1216054223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:11,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:11,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:45:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915895775] [2022-04-28 12:45:11,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:45:11,457 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:45:11,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:45:11,458 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:45:11,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:11,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:45:11,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:11,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:45:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:45:11,474 INFO L87 Difference]: Start difference. First operand 25 states and 28 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:45:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:11,568 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 12:45:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:45:11,568 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:45:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:45:11,569 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:45:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 12:45:11,572 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:45:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 12:45:11,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 12:45:11,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:11,606 INFO L225 Difference]: With dead ends: 36 [2022-04-28 12:45:11,606 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 12:45:11,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:45:11,607 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:45:11,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:45:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 12:45:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 12:45:11,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:45:11,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:11,615 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:11,615 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:11,617 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 12:45:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-28 12:45:11,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:11,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 12:45:11,618 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 12:45:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:11,619 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 12:45:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-28 12:45:11,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:11,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:11,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:45:11,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:45:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 12:45:11,621 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 12:45:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:45:11,622 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 12:45:11,622 INFO L496 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:45:11,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 12:45:11,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 12:45:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 12:45:11,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:45:11,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:45:11,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 12:45:11,872 WARN L477 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-28 12:45:11,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:45:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:45:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash 769172850, now seen corresponding path program 1 times [2022-04-28 12:45:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:11,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137250742] [2022-04-28 12:45:11,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:45:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 769172850, now seen corresponding path program 2 times [2022-04-28 12:45:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:45:11,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831049861] [2022-04-28 12:45:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:45:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:45:11,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:45:11,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985587552] [2022-04-28 12:45:11,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:45:11,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:45:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:45:11,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:45:11,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 12:45:11,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:45:11,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:45:11,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:45:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:11,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:45:12,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 12:45:12,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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);~counter~0 := 0; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {546#(<= ~counter~0 0)} assume true; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {546#(<= ~counter~0 0)} {538#true} #62#return; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {546#(<= ~counter~0 0)} call #t~ret7 := main(); {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {546#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,021 INFO L272 TraceCheckUtils]: 6: Hoare triple {546#(<= ~counter~0 0)} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {546#(<= ~counter~0 0)} ~cond := #in~cond; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {546#(<= ~counter~0 0)} assume !(0 == ~cond); {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#(<= ~counter~0 0)} assume true; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,023 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {546#(<= ~counter~0 0)} {546#(<= ~counter~0 0)} #54#return; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,024 INFO L272 TraceCheckUtils]: 11: Hoare triple {546#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#(<= ~counter~0 0)} ~cond := #in~cond; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#(<= ~counter~0 0)} assume !(0 == ~cond); {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {546#(<= ~counter~0 0)} assume true; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,025 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {546#(<= ~counter~0 0)} {546#(<= ~counter~0 0)} #56#return; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {546#(<= ~counter~0 0)} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {546#(<= ~counter~0 0)} is VALID [2022-04-28 12:45:12,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {546#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {595#(<= |main_#t~post6| 0)} is VALID [2022-04-28 12:45:12,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {539#false} is VALID [2022-04-28 12:45:12,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {539#false} ~x~0 := ~x~0 * (~z~0 - 1); {539#false} is VALID [2022-04-28 12:45:12,027 INFO L272 TraceCheckUtils]: 20: Hoare triple {539#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {539#false} is VALID [2022-04-28 12:45:12,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2022-04-28 12:45:12,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2022-04-28 12:45:12,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 12:45:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:45:12,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:45:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:45:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831049861] [2022-04-28 12:45:12,028 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:45:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985587552] [2022-04-28 12:45:12,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985587552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:12,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:12,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:45:12,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:45:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137250742] [2022-04-28 12:45:12,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137250742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:12,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:12,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:45:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125499465] [2022-04-28 12:45:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:45:12,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 12:45:12,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:45:12,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:12,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:12,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:45:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:45:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:45:12,046 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:12,092 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 12:45:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:45:12,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 12:45:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:45:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 12:45:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 12:45:12,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 12:45:12,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:12,122 INFO L225 Difference]: With dead ends: 40 [2022-04-28 12:45:12,122 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 12:45:12,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:45:12,123 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:45:12,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:45:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 12:45:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 12:45:12,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:45:12,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:12,137 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:12,137 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:12,138 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 12:45:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 12:45:12,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:12,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:12,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 12:45:12,139 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 12:45:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:12,141 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 12:45:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 12:45:12,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:12,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:12,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:45:12,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:45:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 12:45:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 12:45:12,143 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2022-04-28 12:45:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:45:12,143 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 12:45:12,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:45:12,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 12:45:12,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 12:45:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 12:45:12,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:45:12,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:45:12,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 12:45:12,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 12:45:12,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:45:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:45:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 431121724, now seen corresponding path program 1 times [2022-04-28 12:45:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:12,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970570686] [2022-04-28 12:45:12,383 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:45:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash 431121724, now seen corresponding path program 2 times [2022-04-28 12:45:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:45:12,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560723580] [2022-04-28 12:45:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:45:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:45:12,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:45:12,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368470397] [2022-04-28 12:45:12,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:45:12,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:45:12,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:45:12,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:45:12,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 12:45:12,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:45:12,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:45:12,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 12:45:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:45:12,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:45:15,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2022-04-28 12:45:15,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#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);~counter~0 := 0; {821#true} is VALID [2022-04-28 12:45:15,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 12:45:15,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #62#return; {821#true} is VALID [2022-04-28 12:45:15,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret7 := main(); {821#true} is VALID [2022-04-28 12:45:15,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {821#true} is VALID [2022-04-28 12:45:15,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {821#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {821#true} is VALID [2022-04-28 12:45:15,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2022-04-28 12:45:15,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2022-04-28 12:45:15,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 12:45:15,119 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {821#true} {821#true} #54#return; {821#true} is VALID [2022-04-28 12:45:15,119 INFO L272 TraceCheckUtils]: 11: Hoare triple {821#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {821#true} is VALID [2022-04-28 12:45:15,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2022-04-28 12:45:15,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2022-04-28 12:45:15,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 12:45:15,119 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {821#true} {821#true} #56#return; {821#true} is VALID [2022-04-28 12:45:15,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {821#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {821#true} is VALID [2022-04-28 12:45:15,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {821#true} is VALID [2022-04-28 12:45:15,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#true} assume !!(#t~post6 < 2);havoc #t~post6; {821#true} is VALID [2022-04-28 12:45:15,120 INFO L272 TraceCheckUtils]: 19: Hoare triple {821#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {821#true} is VALID [2022-04-28 12:45:15,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {821#true} ~cond := #in~cond; {886#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:45:15,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {886#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {890#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:45:15,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {890#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {890#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:45:15,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {890#(not (= |__VERIFIER_assert_#in~cond| 0))} {821#true} #58#return; {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 12:45:15,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 12:45:15,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {904#(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-28 12:45:15,127 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(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)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:45:15,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:45:15,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {822#false} is VALID [2022-04-28 12:45:15,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-28 12:45:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:45:15,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:45:20,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-28 12:45:20,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {822#false} is VALID [2022-04-28 12:45:20,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:45:20,765 INFO L272 TraceCheckUtils]: 26: Hoare triple {928#(= (+ main_~x~0 1) main_~y~0)} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:45:20,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {928#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-28 12:45:20,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 12:45:20,768 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {890#(not (= |__VERIFIER_assert_#in~cond| 0))} {821#true} #58#return; {897#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 12:45:20,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {890#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {890#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:45:20,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {890#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:45:20,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {821#true} ~cond := #in~cond; {947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:45:20,771 INFO L272 TraceCheckUtils]: 19: Hoare triple {821#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {821#true} is VALID [2022-04-28 12:45:20,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#true} assume !!(#t~post6 < 2);havoc #t~post6; {821#true} is VALID [2022-04-28 12:45:20,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {821#true} is VALID [2022-04-28 12:45:20,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {821#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {821#true} is VALID [2022-04-28 12:45:20,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {821#true} {821#true} #56#return; {821#true} is VALID [2022-04-28 12:45:20,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 12:45:20,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2022-04-28 12:45:20,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2022-04-28 12:45:20,784 INFO L272 TraceCheckUtils]: 11: Hoare triple {821#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {821#true} is VALID [2022-04-28 12:45:20,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {821#true} {821#true} #54#return; {821#true} is VALID [2022-04-28 12:45:20,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 12:45:20,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2022-04-28 12:45:20,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2022-04-28 12:45:20,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {821#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {821#true} is VALID [2022-04-28 12:45:20,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {821#true} is VALID [2022-04-28 12:45:20,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret7 := main(); {821#true} is VALID [2022-04-28 12:45:20,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #62#return; {821#true} is VALID [2022-04-28 12:45:20,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-28 12:45:20,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#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);~counter~0 := 0; {821#true} is VALID [2022-04-28 12:45:20,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2022-04-28 12:45:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:45:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:45:20,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560723580] [2022-04-28 12:45:20,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:45:20,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368470397] [2022-04-28 12:45:20,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368470397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:45:20,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:45:20,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 12:45:20,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:45:20,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970570686] [2022-04-28 12:45:20,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970570686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:45:20,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:45:20,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:45:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909404101] [2022-04-28 12:45:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:45:20,786 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-28 12:45:20,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:45:20,787 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:45:20,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:20,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:45:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:45:20,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:45:20,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:45:20,846 INFO L87 Difference]: Start difference. First operand 32 states and 35 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:45:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:21,002 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 12:45:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:45:21,002 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-28 12:45:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:45:21,003 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:45:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 12:45:21,003 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:45:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 12:45:21,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-28 12:45:21,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:45:21,044 INFO L225 Difference]: With dead ends: 32 [2022-04-28 12:45:21,044 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 12:45:21,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 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-28 12:45:21,045 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:45:21,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-04-28 12:45:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 12:45:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 12:45:21,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:45:21,046 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-28 12:45:21,046 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-28 12:45:21,046 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-28 12:45:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:21,047 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:45:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:45:21,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:21,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:21,047 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-28 12:45:21,047 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-28 12:45:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:45:21,047 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:45:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:45:21,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:21,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:45:21,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:45:21,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:45:21,047 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-28 12:45:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 12:45:21,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-28 12:45:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:45:21,048 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 12:45:21,048 INFO L496 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 12:45:21,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 12:45:21,048 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-28 12:45:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:45:21,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:45:21,050 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:45:21,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 12:45:21,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:45:21,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 12:45:21,428 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-28 12:45:21,428 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-28 12:45:21,428 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-28 12:45:21,428 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-28 12:45:21,429 INFO L902 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-04-28 12:45:21,429 INFO L902 garLoopResultBuilder]: At program point L13-2(lines 12 14) the Hoare annotation is: true [2022-04-28 12:45:21,429 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: true [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 45) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L35-4(lines 35 45) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 23 51) the Hoare annotation is: true [2022-04-28 12:45:21,429 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 23 51) the Hoare annotation is: true [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L36-1(lines 35 45) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 51) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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-28 12:45:21,429 INFO L902 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: true [2022-04-28 12:45:21,429 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 35 45) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-28 12:45:21,431 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 12:45:21,431 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 12:45:21,431 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 12:45:21,431 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 12:45:21,431 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 12:45:21,431 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 12:45:21,431 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 12:45:21,431 INFO L895 garLoopResultBuilder]: At program point L17(lines 17 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 12:45:21,432 INFO L895 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-28 12:45:21,432 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-28 12:45:21,432 INFO L895 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-28 12:45:21,432 INFO L895 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-28 12:45:21,432 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 12:45:21,434 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-28 12:45:21,435 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 12:45:21,438 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 12:45:21,440 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 12:45:21,465 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 12:45:21,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:45:21 BoogieIcfgContainer [2022-04-28 12:45:21,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 12:45:21,474 INFO L158 Benchmark]: Toolchain (without parser) took 11548.61ms. Allocated memory was 202.4MB in the beginning and 313.5MB in the end (delta: 111.1MB). Free memory was 148.7MB in the beginning and 210.9MB in the end (delta: -62.3MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2022-04-28 12:45:21,474 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 12:45:21,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.48ms. Allocated memory was 202.4MB in the beginning and 313.5MB in the end (delta: 111.1MB). Free memory was 148.4MB in the beginning and 283.6MB in the end (delta: -135.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-04-28 12:45:21,475 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 313.5MB. Free memory was 283.6MB in the beginning and 282.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 12:45:21,475 INFO L158 Benchmark]: RCFGBuilder took 202.28ms. Allocated memory is still 313.5MB. Free memory was 282.1MB in the beginning and 271.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 12:45:21,475 INFO L158 Benchmark]: TraceAbstraction took 11075.68ms. Allocated memory is still 313.5MB. Free memory was 270.6MB in the beginning and 210.9MB in the end (delta: 59.7MB). Peak memory consumption was 59.6MB. Max. memory is 8.0GB. [2022-04-28 12:45:21,476 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 202.4MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.48ms. Allocated memory was 202.4MB in the beginning and 313.5MB in the end (delta: 111.1MB). Free memory was 148.4MB in the beginning and 283.6MB in the end (delta: -135.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 313.5MB. Free memory was 283.6MB in the beginning and 282.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 202.28ms. Allocated memory is still 313.5MB. Free memory was 282.1MB in the beginning and 271.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11075.68ms. Allocated memory is still 313.5MB. Free memory was 270.6MB in the beginning and 210.9MB in the end (delta: 59.7MB). Peak memory consumption was 59.6MB. 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 101 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 68 PreInvPairs, 98 NumberOfFragments, 187 HoareAnnotationTreeSize, 68 FomulaSimplifications, 57 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 30 FomulaSimplificationsInter, 76 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: 35]: Loop Invariant Derived loop invariant: z * x + 1 == y + x || !(\old(counter) <= 0) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 23]: 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-28 12:45:21,494 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...