/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:49,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:49,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:49,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:49,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:49,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:49,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:49,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:49,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:49,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:49,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:49,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:49,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:49,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:49,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:49,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:49,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:49,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:49,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:49,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:49,869 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:49,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:49,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:49,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:49,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:49,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:49,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:49,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:49,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:49,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:49,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:49,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:49,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:49,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:49,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:49,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:49,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:49,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:49,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:49,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:49,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:49,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:49,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:49,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:49,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:49,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:49,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:49,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:49,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:49,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:49,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:49,912 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:49,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:49,913 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:49,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:49,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:49,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:49,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:49,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:49,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:49,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:49,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:49,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:49,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:49,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:49,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:49,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:49,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:49,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:49,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:16:50,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:50,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:50,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:50,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:50,157 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:50,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-27 10:16:50,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d029268d/5c655ae3b19f4dd78e6307c462044bb0/FLAGf70005003 [2022-04-27 10:16:50,584 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:50,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2022-04-27 10:16:50,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d029268d/5c655ae3b19f4dd78e6307c462044bb0/FLAGf70005003 [2022-04-27 10:16:50,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d029268d/5c655ae3b19f4dd78e6307c462044bb0 [2022-04-27 10:16:50,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:50,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:50,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:50,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:50,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:50,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149afe81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50, skipping insertion in model container [2022-04-27 10:16:50,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:50,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:50,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c[416,429] [2022-04-27 10:16:50,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:50,832 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:50,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c[416,429] [2022-04-27 10:16:50,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:50,864 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:50,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50 WrapperNode [2022-04-27 10:16:50,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:50,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:50,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:50,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:50,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:50,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:50,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:50,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:50,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:50,936 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-27 10:16:50,952 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-27 10:16:50,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:16:50,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:16:50,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:51,024 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:51,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:51,199 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:51,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:51,204 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:16:51,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51 BoogieIcfgContainer [2022-04-27 10:16:51,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:51,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:51,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:51,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:51,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:50" (1/3) ... [2022-04-27 10:16:51,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (2/3) ... [2022-04-27 10:16:51,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51" (3/3) ... [2022-04-27 10:16:51,227 INFO L111 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2022-04-27 10:16:51,236 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:51,237 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:51,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:51,282 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@131d95dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f10cd20 [2022-04-27 10:16:51,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:16:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:16:51,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash 669529748, now seen corresponding path program 1 times [2022-04-27 10:16:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827987946] [2022-04-27 10:16:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 10:16:51,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:16:51,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-27 10:16:51,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:51,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 10:16:51,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:16:51,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-27 10:16:51,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2022-04-27 10:16:51,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {27#true} is VALID [2022-04-27 10:16:51,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~n~0 > 0);~i~0 := 0; {27#true} is VALID [2022-04-27 10:16:51,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-27 10:16:51,434 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {28#false} is VALID [2022-04-27 10:16:51,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 10:16:51,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 10:16:51,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 10:16:51,434 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-27 10:16:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:51,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827987946] [2022-04-27 10:16:51,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827987946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:51,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:51,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:16:51,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159299995] [2022-04-27 10:16:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:51,441 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-27 10:16:51,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:51,444 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-27 10:16:51,460 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-27 10:16:51,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:16:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:16:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:51,477 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-27 10:16:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,587 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-27 10:16:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:16:51,588 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-27 10:16:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:51,589 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-27 10:16:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 10:16:51,598 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-27 10:16:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 10:16:51,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 10:16:51,671 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-27 10:16:51,680 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:16:51,680 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:16:51,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:51,687 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:51,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:16:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 10:16:51,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:51,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:51,715 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:51,715 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,720 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 10:16:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:16:51,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:51,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:51,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 10:16:51,721 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 10:16:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,727 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 10:16:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:16:51,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:51,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:51,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:51,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 10:16:51,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-27 10:16:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:51,734 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 10:16:51,735 INFO L496 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-27 10:16:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:16:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:16:51,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:51,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 657523975, now seen corresponding path program 1 times [2022-04-27 10:16:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054142981] [2022-04-27 10:16:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-27 10:16:51,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-27 10:16:51,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #60#return; {159#true} is VALID [2022-04-27 10:16:51,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:51,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-27 10:16:51,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-27 10:16:51,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #60#return; {159#true} is VALID [2022-04-27 10:16:51,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret7 := main(); {159#true} is VALID [2022-04-27 10:16:51,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {159#true} is VALID [2022-04-27 10:16:51,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume !!(~n~0 > 0);~i~0 := 0; {164#(and (<= 1 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:51,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(and (<= 1 main_~n~0) (= main_~i~0 0))} assume !(~i~0 < ~n~0); {160#false} is VALID [2022-04-27 10:16:51,860 INFO L272 TraceCheckUtils]: 8: Hoare triple {160#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {160#false} is VALID [2022-04-27 10:16:51,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {160#false} ~cond := #in~cond; {160#false} is VALID [2022-04-27 10:16:51,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {160#false} assume 0 == ~cond; {160#false} is VALID [2022-04-27 10:16:51,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-27 10:16:51,861 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-27 10:16:51,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:51,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054142981] [2022-04-27 10:16:51,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054142981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:51,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:51,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816336526] [2022-04-27 10:16:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-27 10:16:51,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:51,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-27 10:16:51,875 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-27 10:16:51,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:51,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:51,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:51,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:51,877 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-27 10:16:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,996 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 10:16:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:16:51,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-27 10:16:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-27 10:16:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 10:16:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-27 10:16:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 10:16:52,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-27 10:16:52,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,039 INFO L225 Difference]: With dead ends: 33 [2022-04-27 10:16:52,039 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:16:52,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:52,047 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:16:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-27 10:16:52,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:52,057 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:52,058 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,062 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 10:16:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 10:16:52,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:16:52,063 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:16:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,066 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 10:16:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 10:16:52,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 10:16:52,068 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-27 10:16:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,069 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 10:16:52,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-27 10:16:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:16:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:16:52,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:16:52,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash 659251853, now seen corresponding path program 1 times [2022-04-27 10:16:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463279221] [2022-04-27 10:16:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {300#true} is VALID [2022-04-27 10:16:52,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2022-04-27 10:16:52,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #60#return; {300#true} is VALID [2022-04-27 10:16:52,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {300#true} is VALID [2022-04-27 10:16:52,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#true} assume true; {300#true} is VALID [2022-04-27 10:16:52,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#true} {300#true} #60#return; {300#true} is VALID [2022-04-27 10:16:52,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#true} call #t~ret7 := main(); {300#true} is VALID [2022-04-27 10:16:52,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {305#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 10:16:52,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~n~0 > 0);~i~0 := 0; {305#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 10:16:52,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {305#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {306#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} is VALID [2022-04-27 10:16:52,170 INFO L272 TraceCheckUtils]: 8: Hoare triple {306#(and (<= main_~x~0 0) (< 0 (+ main_~x~0 1)))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {307#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:16:52,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {308#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:16:52,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {301#false} is VALID [2022-04-27 10:16:52,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#false} assume !false; {301#false} is VALID [2022-04-27 10:16:52,171 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-27 10:16:52,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463279221] [2022-04-27 10:16:52,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463279221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:16:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615581529] [2022-04-27 10:16:52,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 10:16:52,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 10:16:52,181 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-27 10:16:52,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:16:52,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:16:52,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:16:52,182 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 10:16:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,366 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 10:16:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:16:52,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 10:16:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 10:16:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-27 10:16:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 10:16:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-27 10:16:52,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-27 10:16:52,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,395 INFO L225 Difference]: With dead ends: 30 [2022-04-27 10:16:52,395 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 10:16:52,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:16:52,396 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 10:16:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-04-27 10:16:52,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:16:52,412 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:16:52,412 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:16:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,414 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 10:16:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:16:52,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-27 10:16:52,419 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-27 10:16:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,423 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 10:16:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:16:52,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:16:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-27 10:16:52,426 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-04-27 10:16:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,426 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-27 10:16:52,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 10:16:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 10:16:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:16:52,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,431 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:16:52,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash -932371294, now seen corresponding path program 1 times [2022-04-27 10:16:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820819857] [2022-04-27 10:16:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-27 10:16:52,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:16:52,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #60#return; {458#true} is VALID [2022-04-27 10:16:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 10:16:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 10:16:52,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 10:16:52,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:16:52,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {464#(= main_~x~0 0)} #54#return; {464#(= main_~x~0 0)} is VALID [2022-04-27 10:16:52,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-27 10:16:52,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:16:52,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #60#return; {458#true} is VALID [2022-04-27 10:16:52,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret7 := main(); {458#true} is VALID [2022-04-27 10:16:52,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {463#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 10:16:52,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~n~0 > 0);~i~0 := 0; {463#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 10:16:52,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {464#(= main_~x~0 0)} is VALID [2022-04-27 10:16:52,537 INFO L272 TraceCheckUtils]: 8: Hoare triple {464#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {458#true} is VALID [2022-04-27 10:16:52,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 10:16:52,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 10:16:52,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 10:16:52,537 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {458#true} {464#(= main_~x~0 0)} #54#return; {464#(= main_~x~0 0)} is VALID [2022-04-27 10:16:52,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#(= main_~x~0 0)} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~y~0 := #t~nondet6;havoc #t~nondet6; {464#(= main_~x~0 0)} is VALID [2022-04-27 10:16:52,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {464#(= main_~x~0 0)} assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; {469#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} is VALID [2022-04-27 10:16:52,539 INFO L272 TraceCheckUtils]: 15: Hoare triple {469#(or (<= 1 main_~x~0) (<= (+ main_~x~0 1) 0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {470#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:16:52,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {470#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {471#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:16:52,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {471#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {459#false} is VALID [2022-04-27 10:16:52,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {459#false} assume !false; {459#false} is VALID [2022-04-27 10:16:52,540 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-27 10:16:52,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820819857] [2022-04-27 10:16:52,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820819857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:16:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416146054] [2022-04-27 10:16:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 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 19 [2022-04-27 10:16:52,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 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-27 10:16:52,554 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-27 10:16:52,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:16:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:16:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:16:52,556 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 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-27 10:16:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,809 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 10:16:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:16:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 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 19 [2022-04-27 10:16:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 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-27 10:16:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-27 10:16:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 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-27 10:16:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-27 10:16:52,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-27 10:16:52,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,843 INFO L225 Difference]: With dead ends: 38 [2022-04-27 10:16:52,843 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 10:16:52,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:16:52,850 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 10:16:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-27 10:16:52,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:16:52,860 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:16:52,860 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:16:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,861 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 10:16:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 10:16:52,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-27 10:16:52,862 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-27 10:16:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,863 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 10:16:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 10:16:52,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:16:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 10:16:52,864 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2022-04-27 10:16:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,864 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 10:16:52,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 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-27 10:16:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 10:16:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 10:16:52,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:16:52,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1861509246, now seen corresponding path program 1 times [2022-04-27 10:16:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371457448] [2022-04-27 10:16:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:16:52,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:16:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:16:52,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:16:52,922 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:16:52,923 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:16:52,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:16:52,926 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 10:16:52,928 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 10:16:52,951 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:16:52,952 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:16:52,952 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-27 10:16:52,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:16:52 BoogieIcfgContainer [2022-04-27 10:16:52,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:16:52,954 INFO L158 Benchmark]: Toolchain (without parser) took 2347.81ms. Allocated memory was 181.4MB in the beginning and 250.6MB in the end (delta: 69.2MB). Free memory was 125.2MB in the beginning and 169.4MB in the end (delta: -44.2MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. [2022-04-27 10:16:52,954 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:16:52,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.26ms. Allocated memory was 181.4MB in the beginning and 250.6MB in the end (delta: 69.2MB). Free memory was 125.0MB in the beginning and 223.6MB in the end (delta: -98.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 10:16:52,954 INFO L158 Benchmark]: Boogie Preprocessor took 35.14ms. Allocated memory is still 250.6MB. Free memory was 223.6MB in the beginning and 222.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:16:52,954 INFO L158 Benchmark]: RCFGBuilder took 304.57ms. Allocated memory is still 250.6MB. Free memory was 222.1MB in the beginning and 210.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:16:52,955 INFO L158 Benchmark]: TraceAbstraction took 1746.31ms. Allocated memory is still 250.6MB. Free memory was 209.5MB in the beginning and 169.4MB in the end (delta: 40.2MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. [2022-04-27 10:16:52,955 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.26ms. Allocated memory was 181.4MB in the beginning and 250.6MB in the end (delta: 69.2MB). Free memory was 125.0MB in the beginning and 223.6MB in the end (delta: -98.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.14ms. Allocated memory is still 250.6MB. Free memory was 223.6MB in the beginning and 222.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 304.57ms. Allocated memory is still 250.6MB. Free memory was 222.1MB in the beginning and 210.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1746.31ms. Allocated memory is still 250.6MB. Free memory was 209.5MB in the beginning and 169.4MB in the end (delta: 40.2MB). Peak memory consumption was 41.2MB. 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: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int i=0, x=0, y=0; [L20] int n=__VERIFIER_nondet_int(); [L21] COND FALSE !(!(n>0)) [L22] i=0 VAL [i=0, n=1, x=0, y=0] [L22] COND TRUE i