/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:38:44,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:38:44,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:38:44,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:38:44,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:38:44,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:38:44,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:38:44,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:38:44,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:38:44,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:38:44,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:38:44,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:38:44,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:38:44,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:38:44,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:38:44,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:38:44,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:38:44,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:38:44,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:38:44,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:38:44,923 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:38:44,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:38:44,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:38:44,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:38:44,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:38:44,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:38:44,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:38:44,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:38:44,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:38:44,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:38:44,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:38:44,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:38:44,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:38:44,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:38:44,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:38:44,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:38:44,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:38:44,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:38:44,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:38:44,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:38:44,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:38:44,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:38:44,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:38:44,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:38:44,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:38:44,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:38:44,948 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:38:44,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:38:44,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:38:44,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:38:44,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:38:44,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:38:44,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:38:44,949 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:38:44,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:38:44,950 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:38:44,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:38:44,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:38:44,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:38:44,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:38:44,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:38:44,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:38:44,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:38:44,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:38:44,951 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:38:44,951 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:38:44,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:38:44,951 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:38:44,951 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 06:38:45,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:38:45,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:38:45,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:38:45,162 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:38:45,164 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:38:45,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound1.c [2022-04-08 06:38:45,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3977cb84/e35fe4df29894cc79f1d7d92120e73cd/FLAGe471dfdf8 [2022-04-08 06:38:45,576 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:38:45,576 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound1.c [2022-04-08 06:38:45,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3977cb84/e35fe4df29894cc79f1d7d92120e73cd/FLAGe471dfdf8 [2022-04-08 06:38:45,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3977cb84/e35fe4df29894cc79f1d7d92120e73cd [2022-04-08 06:38:45,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:38:45,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:38:45,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:38:45,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:38:45,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:38:45,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2798affb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45, skipping insertion in model container [2022-04-08 06:38:45,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:38:45,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:38:45,733 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/hard2_unwindbound1.c[526,539] [2022-04-08 06:38:45,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:38:45,764 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:38:45,772 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/hard2_unwindbound1.c[526,539] [2022-04-08 06:38:45,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:38:45,787 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:38:45,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45 WrapperNode [2022-04-08 06:38:45,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:38:45,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:38:45,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:38:45,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:38:45,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:38:45,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:38:45,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:38:45,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:38:45,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (1/1) ... [2022-04-08 06:38:45,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:38:45,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:45,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 06:38:45,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 06:38:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:38:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:38:45,868 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:38:45,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:38:45,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:38:45,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:38:45,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:38:45,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:38:45,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:38:45,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:38:45,909 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:38:45,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:38:46,085 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:38:46,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:38:46,091 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 06:38:46,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:38:46 BoogieIcfgContainer [2022-04-08 06:38:46,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:38:46,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:38:46,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:38:46,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:38:46,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:38:45" (1/3) ... [2022-04-08 06:38:46,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4231ff39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:38:46, skipping insertion in model container [2022-04-08 06:38:46,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:45" (2/3) ... [2022-04-08 06:38:46,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4231ff39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:38:46, skipping insertion in model container [2022-04-08 06:38:46,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:38:46" (3/3) ... [2022-04-08 06:38:46,098 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound1.c [2022-04-08 06:38:46,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:38:46,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:38:46,131 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:38:46,136 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 06:38:46,136 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:38:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:38:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 06:38:46,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:46,154 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:46,154 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:46,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-08 06:38:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:46,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1702383597] [2022-04-08 06:38:46,171 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-08 06:38:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:46,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226329712] [2022-04-08 06:38:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:46,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:46,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 06:38:46,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 06:38:46,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 06:38:46,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:46,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 06:38:46,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 06:38:46,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 06:38:46,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-08 06:38:46,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-08 06:38:46,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 06:38:46,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-08 06:38:46,339 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-08 06:38:46,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 06:38:46,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 06:38:46,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 06:38:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 06:38:46,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:46,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226329712] [2022-04-08 06:38:46,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226329712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:46,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:46,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:38:46,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1702383597] [2022-04-08 06:38:46,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1702383597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:46,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:46,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:38:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897992081] [2022-04-08 06:38:46,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 06:38:46,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:46,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:46,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:46,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 06:38:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:46,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 06:38:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:38:46,389 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:46,568 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-08 06:38:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 06:38:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 06:38:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 06:38:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 06:38:46,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-08 06:38:46,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:46,720 INFO L225 Difference]: With dead ends: 57 [2022-04-08 06:38:46,720 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 06:38:46,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:38:46,725 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:46,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:38:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 06:38:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 06:38:46,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:46,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:46,767 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:46,768 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:46,773 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 06:38:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 06:38:46,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:46,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:46,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 06:38:46,774 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 06:38:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:46,778 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 06:38:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 06:38:46,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:46,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:46,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:46,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-08 06:38:46,783 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-08 06:38:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:46,784 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-08 06:38:46,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:46,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-08 06:38:46,865 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-08 06:38:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-08 06:38:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 06:38:46,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:46,866 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:46,866 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 06:38:46,867 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-08 06:38:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:46,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780142467] [2022-04-08 06:38:46,868 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-08 06:38:46,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:46,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869852789] [2022-04-08 06:38:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:46,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:46,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-08 06:38:46,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 06:38:46,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 06:38:46,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:46,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-08 06:38:46,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 06:38:46,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 06:38:46,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-08 06:38:46,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID [2022-04-08 06:38:46,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-08 06:38:46,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 1);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-08 06:38:46,996 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:46,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:38:46,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-08 06:38:46,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 06:38:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 06:38:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:46,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869852789] [2022-04-08 06:38:46,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869852789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:46,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:46,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:46,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:46,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780142467] [2022-04-08 06:38:46,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780142467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:46,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:46,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001377749] [2022-04-08 06:38:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 06:38:47,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:47,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:47,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:47,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:47,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:47,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:47,016 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:47,316 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-08 06:38:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:38:47,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 06:38:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 06:38:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 06:38:47,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 06:38:47,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:47,369 INFO L225 Difference]: With dead ends: 41 [2022-04-08 06:38:47,369 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 06:38:47,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:38:47,371 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:47,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:38:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 06:38:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-08 06:38:47,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:47,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,377 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,377 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:47,380 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 06:38:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 06:38:47,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:47,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:47,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 06:38:47,381 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 06:38:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:47,383 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 06:38:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 06:38:47,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:47,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:47,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:47,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-08 06:38:47,386 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-08 06:38:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:47,387 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-08 06:38:47,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-08 06:38:47,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-08 06:38:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 06:38:47,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:47,420 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:47,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 06:38:47,421 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-08 06:38:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [692347089] [2022-04-08 06:38:47,422 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-08 06:38:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:47,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724460879] [2022-04-08 06:38:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:47,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:47,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 06:38:47,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID [2022-04-08 06:38:47,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {502#false} is VALID [2022-04-08 06:38:47,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-08 06:38:47,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 1);havoc #t~post6; {502#false} is VALID [2022-04-08 06:38:47,481 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID [2022-04-08 06:38:47,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-08 06:38:47,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-08 06:38:47,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-08 06:38:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 06:38:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724460879] [2022-04-08 06:38:47,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724460879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:47,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:47,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:38:47,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:47,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [692347089] [2022-04-08 06:38:47,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [692347089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:47,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:47,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:38:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091195040] [2022-04-08 06:38:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:47,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 06:38:47,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:47,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:47,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:38:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:47,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:38:47,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:38:47,499 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:47,646 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-08 06:38:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:38:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 06:38:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 06:38:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 06:38:47,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-08 06:38:47,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:47,693 INFO L225 Difference]: With dead ends: 46 [2022-04-08 06:38:47,693 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 06:38:47,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:47,699 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:47,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:38:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 06:38:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 06:38:47,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:47,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,715 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,716 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:47,722 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 06:38:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:38:47,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:47,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:47,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 06:38:47,723 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 06:38:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:47,724 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 06:38:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:38:47,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:47,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:47,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:47,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 06:38:47,727 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-08 06:38:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:47,727 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 06:38:47,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 06:38:47,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 06:38:47,755 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-08 06:38:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:38:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 06:38:47,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:47,756 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:47,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 06:38:47,756 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-08 06:38:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877793644] [2022-04-08 06:38:47,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-08 06:38:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640599071] [2022-04-08 06:38:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:47,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:47,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-08 06:38:47,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 06:38:47,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 06:38:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-08 06:38:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:47,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 06:38:47,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 06:38:47,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 06:38:47,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:47,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:47,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-08 06:38:47,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 06:38:47,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 06:38:47,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-08 06:38:47,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:47,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:47,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 1);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:47,818 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID [2022-04-08 06:38:47,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 06:38:47,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 06:38:47,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 06:38:47,819 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:47,819 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:47,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:38:47,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-08 06:38:47,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-08 06:38:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 06:38:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:47,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640599071] [2022-04-08 06:38:47,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640599071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:47,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:47,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:47,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:47,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877793644] [2022-04-08 06:38:47,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877793644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:47,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:47,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786313602] [2022-04-08 06:38:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:47,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 06:38:47,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:47,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:38:47,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:47,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:47,838 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:38:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:48,088 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 06:38:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:38:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 06:38:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:38:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 06:38:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:38:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 06:38:48,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 06:38:48,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:48,132 INFO L225 Difference]: With dead ends: 46 [2022-04-08 06:38:48,132 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 06:38:48,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:38:48,133 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:48,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:38:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 06:38:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-08 06:38:48,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:48,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:48,144 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:48,145 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:48,149 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 06:38:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 06:38:48,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:48,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:48,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 06:38:48,150 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 06:38:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:48,153 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 06:38:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 06:38:48,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:48,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:48,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:48,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:38:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-08 06:38:48,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-08 06:38:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:48,157 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-08 06:38:48,158 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 06:38:48,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-08 06:38:48,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-08 06:38:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 06:38:48,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:48,188 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:48,189 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 06:38:48,189 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-08 06:38:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:48,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006118107] [2022-04-08 06:38:48,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-08 06:38:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:48,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785215226] [2022-04-08 06:38:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:48,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:48,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055798827] [2022-04-08 06:38:48,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:48,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:48,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:48,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:38:48,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 06:38:48,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:48,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:48,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:38:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:48,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:48,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-08 06:38:48,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID [2022-04-08 06:38:48,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 06:38:48,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-08 06:38:48,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-08 06:38:48,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:48,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:48,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:48,515 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID [2022-04-08 06:38:48,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 06:38:48,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 06:38:48,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 06:38:48,516 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:48,516 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID [2022-04-08 06:38:48,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 06:38:48,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 06:38:48,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 06:38:48,517 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:48,518 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:48,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:48,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-08 06:38:48,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-08 06:38:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:38:48,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:38:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785215226] [2022-04-08 06:38:48,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055798827] [2022-04-08 06:38:48,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055798827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:48,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:48,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:48,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:48,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006118107] [2022-04-08 06:38:48,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006118107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:48,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:48,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805679043] [2022-04-08 06:38:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:48,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 06:38:48,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:48,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:38:48,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:48,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:38:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:38:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:38:48,534 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:38:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:48,717 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-08 06:38:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:38:48,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 06:38:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:38:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 06:38:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:38:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 06:38:48,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-08 06:38:48,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:48,776 INFO L225 Difference]: With dead ends: 65 [2022-04-08 06:38:48,776 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 06:38:48,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:48,786 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:48,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:38:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 06:38:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 06:38:48,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:48,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:38:48,803 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:38:48,803 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:38:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:48,805 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 06:38:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 06:38:48,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:48,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:48,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 06:38:48,806 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 06:38:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:48,808 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 06:38:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 06:38:48,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:48,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:48,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:48,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:38:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 06:38:48,810 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-08 06:38:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:48,810 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-08 06:38:48,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:38:48,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-08 06:38:48,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 06:38:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 06:38:48,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:48,861 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:48,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 06:38:49,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:49,070 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-08 06:38:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:49,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2114309659] [2022-04-08 06:38:49,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:49,071 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-08 06:38:49,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:49,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364469406] [2022-04-08 06:38:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:49,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:49,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:49,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115180198] [2022-04-08 06:38:49,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:49,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:38:49,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 06:38:49,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:49,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:49,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:38:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:49,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:49,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-08 06:38:49,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1410#true} is VALID [2022-04-08 06:38:49,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-08 06:38:49,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1410#true} {1410#true} #92#return; {1410#true} is VALID [2022-04-08 06:38:49,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {1410#true} call #t~ret7 := main(); {1410#true} is VALID [2022-04-08 06:38:49,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,289 INFO L272 TraceCheckUtils]: 8: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1410#true} is VALID [2022-04-08 06:38:49,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {1410#true} ~cond := #in~cond; {1410#true} is VALID [2022-04-08 06:38:49,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {1410#true} assume !(0 == ~cond); {1410#true} is VALID [2022-04-08 06:38:49,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-08 06:38:49,290 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1410#true} {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,290 INFO L272 TraceCheckUtils]: 13: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1410#true} is VALID [2022-04-08 06:38:49,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {1410#true} ~cond := #in~cond; {1410#true} is VALID [2022-04-08 06:38:49,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1410#true} assume !(0 == ~cond); {1410#true} is VALID [2022-04-08 06:38:49,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-08 06:38:49,291 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1410#true} {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,291 INFO L272 TraceCheckUtils]: 18: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1410#true} is VALID [2022-04-08 06:38:49,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {1410#true} ~cond := #in~cond; {1410#true} is VALID [2022-04-08 06:38:49,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {1410#true} assume !(0 == ~cond); {1410#true} is VALID [2022-04-08 06:38:49,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-08 06:38:49,292 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1410#true} {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post6 < 1);havoc #t~post6; {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:38:49,294 INFO L272 TraceCheckUtils]: 26: Hoare triple {1430#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:49,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:49,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {1498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1411#false} is VALID [2022-04-08 06:38:49,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-08 06:38:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 06:38:49,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:38:49,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364469406] [2022-04-08 06:38:49,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115180198] [2022-04-08 06:38:49,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115180198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:49,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:49,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:49,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2114309659] [2022-04-08 06:38:49,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2114309659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:49,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:49,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721909981] [2022-04-08 06:38:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:49,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 06:38:49,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:49,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:49,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:49,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:38:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:49,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:38:49,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:38:49,311 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:49,434 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 06:38:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:38:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 06:38:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 06:38:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 06:38:49,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 06:38:49,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:49,474 INFO L225 Difference]: With dead ends: 64 [2022-04-08 06:38:49,475 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 06:38:49,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:49,477 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:49,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:38:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 06:38:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-08 06:38:49,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:49,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 06:38:49,504 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 06:38:49,504 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 06:38:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:49,506 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 06:38:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 06:38:49,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:49,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:49,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-08 06:38:49,508 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-08 06:38:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:49,510 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-08 06:38:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-08 06:38:49,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:49,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:49,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:49,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 06:38:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-04-08 06:38:49,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 30 [2022-04-08 06:38:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:49,513 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-04-08 06:38:49,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:49,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 70 transitions. [2022-04-08 06:38:49,557 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-08 06:38:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 06:38:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 06:38:49,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:49,558 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:49,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 06:38:49,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 06:38:49,772 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-08 06:38:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:49,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252713963] [2022-04-08 06:38:52,044 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:38:52,044 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 06:38:52,044 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:38:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-08 06:38:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:52,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372160533] [2022-04-08 06:38:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:52,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:52,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033100906] [2022-04-08 06:38:52,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:52,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:38:52,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 06:38:52,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:52,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 06:38:52,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 06:38:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 06:38:52,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 06:38:52,152 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 06:38:52,152 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 06:38:52,154 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 06:38:52,181 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-08 06:38:52,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:52,380 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-08 06:38:52,382 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 06:38:52,392 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 06:38:52,392 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 06:38:52,392 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 06:38:52,393 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 06:38:52,394 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 06:38:52,394 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 06:38:52,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 06:38:52 BoogieIcfgContainer [2022-04-08 06:38:52,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 06:38:52,396 INFO L158 Benchmark]: Toolchain (without parser) took 6804.14ms. Allocated memory was 221.2MB in the beginning and 268.4MB in the end (delta: 47.2MB). Free memory was 171.3MB in the beginning and 141.0MB in the end (delta: 30.3MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2022-04-08 06:38:52,396 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory was 187.8MB in the beginning and 187.6MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 06:38:52,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.90ms. Allocated memory is still 221.2MB. Free memory was 171.1MB in the beginning and 197.5MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 06:38:52,396 INFO L158 Benchmark]: Boogie Preprocessor took 21.76ms. Allocated memory is still 221.2MB. Free memory was 197.5MB in the beginning and 196.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 06:38:52,397 INFO L158 Benchmark]: RCFGBuilder took 282.37ms. Allocated memory is still 221.2MB. Free memory was 196.0MB in the beginning and 184.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 06:38:52,397 INFO L158 Benchmark]: TraceAbstraction took 6301.54ms. Allocated memory was 221.2MB in the beginning and 268.4MB in the end (delta: 47.2MB). Free memory was 183.8MB in the beginning and 141.0MB in the end (delta: 42.8MB). Peak memory consumption was 90.4MB. Max. memory is 8.0GB. [2022-04-08 06:38:52,398 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.09ms. Allocated memory is still 221.2MB. Free memory was 187.8MB in the beginning and 187.6MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.90ms. Allocated memory is still 221.2MB. Free memory was 171.1MB in the beginning and 197.5MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.76ms. Allocated memory is still 221.2MB. Free memory was 197.5MB in the beginning and 196.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.37ms. Allocated memory is still 221.2MB. Free memory was 196.0MB in the beginning and 184.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6301.54ms. Allocated memory was 221.2MB in the beginning and 268.4MB in the end (delta: 47.2MB). Free memory was 183.8MB in the beginning and 141.0MB in the end (delta: 42.8MB). Peak memory consumption was 90.4MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 [L34] EXPR counter++ [L34] COND TRUE counter++<1 [L35] CALL __VERIFIER_assert(q == 0) [L15] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(q == 0) [L36] CALL __VERIFIER_assert(r == A) [L15] COND FALSE !(!(cond)) [L36] RET __VERIFIER_assert(r == A) [L37] CALL __VERIFIER_assert(d == B * p) [L15] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(d == B * p) [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p [L34] EXPR counter++ [L34] COND FALSE !(counter++<1) [L44] EXPR counter++ [L44] COND FALSE !(counter++<1) [L58] CALL __VERIFIER_assert(A == d*q + r) [L15] COND FALSE !(!(cond)) [L58] RET __VERIFIER_assert(A == d*q + r) [L59] CALL __VERIFIER_assert(B == d) [L15] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 496 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 340 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 209 mSDtfsCounter, 340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-08 06:38:52,410 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...