/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:10,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:10,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:10,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:10,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:10,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:10,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:10,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:10,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:10,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:10,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:10,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:10,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:10,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:10,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:10,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:10,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:10,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:10,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:10,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:10,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:10,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:10,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:10,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:10,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:10,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:10,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:10,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:10,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:10,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:10,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:10,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:10,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:10,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:10,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:10,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:10,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:10,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:10,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:10,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:10,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:10,972 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 [2020-07-17 22:51:10,987 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:10,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:10,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:10,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:10,989 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:10,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:10,989 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:10,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:10,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:10,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:10,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:10,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:10,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:10,991 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:10,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:10,991 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:10,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:10,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:10,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:10,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:10,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:10,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:10,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:10,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:10,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:10,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:10,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:10,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:10,994 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:10,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:11,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:11,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:11,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:11,353 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:11,354 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:11,355 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-17 22:51:11,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c232ed44/07121759c5f9458fa77eed0ecb9e2b1d/FLAGbbfaf3199 [2020-07-17 22:51:11,926 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:11,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-17 22:51:11,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c232ed44/07121759c5f9458fa77eed0ecb9e2b1d/FLAGbbfaf3199 [2020-07-17 22:51:12,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c232ed44/07121759c5f9458fa77eed0ecb9e2b1d [2020-07-17 22:51:12,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:12,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:12,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:12,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:12,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:12,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad95b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12, skipping insertion in model container [2020-07-17 22:51:12,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:12,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:12,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:12,569 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:12,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:12,608 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:12,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12 WrapperNode [2020-07-17 22:51:12,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:12,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:12,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:12,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:12,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... [2020-07-17 22:51:12,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:12,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:12,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:12,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:12,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:12,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:12,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:13,091 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:13,092 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:51:13,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:13 BoogieIcfgContainer [2020-07-17 22:51:13,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:13,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:13,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:13,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:13,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:12" (1/3) ... [2020-07-17 22:51:13,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5a9f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:13, skipping insertion in model container [2020-07-17 22:51:13,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:12" (2/3) ... [2020-07-17 22:51:13,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5a9f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:13, skipping insertion in model container [2020-07-17 22:51:13,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:13" (3/3) ... [2020-07-17 22:51:13,108 INFO L109 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2020-07-17 22:51:13,123 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:13,133 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:13,153 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:13,184 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:13,184 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:13,184 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:13,184 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:13,185 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:13,185 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:13,185 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:13,186 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-17 22:51:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:51:13,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:13,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:13,221 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 826978896, now seen corresponding path program 1 times [2020-07-17 22:51:13,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:13,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58290261] [2020-07-17 22:51:13,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:13,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-17 22:51:13,558 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25#true} {25#true} #49#return; {25#true} is VALID [2020-07-17 22:51:13,560 INFO L263 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2020-07-17 22:51:13,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-17 22:51:13,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #49#return; {25#true} is VALID [2020-07-17 22:51:13,562 INFO L263 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret2 := main(); {25#true} is VALID [2020-07-17 22:51:13,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {25#true} is VALID [2020-07-17 22:51:13,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {25#true} is VALID [2020-07-17 22:51:13,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {29#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-17 22:51:13,565 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {29#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-17 22:51:13,568 INFO L263 TraceCheckUtils]: 8: Hoare triple {29#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:13,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {31#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:13,570 INFO L280 TraceCheckUtils]: 10: Hoare triple {31#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {26#false} is VALID [2020-07-17 22:51:13,570 INFO L280 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-17 22:51:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:13,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58290261] [2020-07-17 22:51:13,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:13,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:13,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565269089] [2020-07-17 22:51:13,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-17 22:51:13,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:13,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:13,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:13,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:13,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:13,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:13,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:13,654 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2020-07-17 22:51:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:13,915 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:51:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:13,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-17 22:51:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-17 22:51:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-17 22:51:13,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2020-07-17 22:51:14,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:14,045 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:51:14,045 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:51:14,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:51:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-17 22:51:14,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:14,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:14,112 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:14,113 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,117 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-17 22:51:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-17 22:51:14,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,119 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:14,119 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:51:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,123 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-17 22:51:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-17 22:51:14,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:14,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:51:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-17 22:51:14,129 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2020-07-17 22:51:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:14,130 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-17 22:51:14,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-17 22:51:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:51:14,132 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:14,132 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:14,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:14,133 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1747164342, now seen corresponding path program 1 times [2020-07-17 22:51:14,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:14,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131753150] [2020-07-17 22:51:14,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-17 22:51:14,287 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {168#true} {168#true} #49#return; {168#true} is VALID [2020-07-17 22:51:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} ~cond := #in~cond; {168#true} is VALID [2020-07-17 22:51:14,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume !(0 == ~cond); {168#true} is VALID [2020-07-17 22:51:14,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-17 22:51:14,334 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {168#true} {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:14,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2020-07-17 22:51:14,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-17 22:51:14,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #49#return; {168#true} is VALID [2020-07-17 22:51:14,337 INFO L263 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret2 := main(); {168#true} is VALID [2020-07-17 22:51:14,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {168#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {168#true} is VALID [2020-07-17 22:51:14,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {168#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {172#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:14,342 INFO L280 TraceCheckUtils]: 6: Hoare triple {172#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:14,344 INFO L280 TraceCheckUtils]: 7: Hoare triple {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:14,344 INFO L263 TraceCheckUtils]: 8: Hoare triple {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {168#true} is VALID [2020-07-17 22:51:14,345 INFO L280 TraceCheckUtils]: 9: Hoare triple {168#true} ~cond := #in~cond; {168#true} is VALID [2020-07-17 22:51:14,345 INFO L280 TraceCheckUtils]: 10: Hoare triple {168#true} assume !(0 == ~cond); {168#true} is VALID [2020-07-17 22:51:14,346 INFO L280 TraceCheckUtils]: 11: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-17 22:51:14,347 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {168#true} {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:14,349 INFO L263 TraceCheckUtils]: 13: Hoare triple {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {178#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:14,350 INFO L280 TraceCheckUtils]: 14: Hoare triple {178#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {179#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:14,351 INFO L280 TraceCheckUtils]: 15: Hoare triple {179#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {169#false} is VALID [2020-07-17 22:51:14,351 INFO L280 TraceCheckUtils]: 16: Hoare triple {169#false} assume !false; {169#false} is VALID [2020-07-17 22:51:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:14,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131753150] [2020-07-17 22:51:14,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:14,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:14,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747044623] [2020-07-17 22:51:14,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:51:14,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:14,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:14,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:14,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:14,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:14,400 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2020-07-17 22:51:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,617 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-17 22:51:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:14,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:51:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-17 22:51:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-17 22:51:14,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-17 22:51:14,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:14,668 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:51:14,669 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:51:14,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:51:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:51:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-17 22:51:14,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:14,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-17 22:51:14,695 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-17 22:51:14,695 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-17 22:51:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,701 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-17 22:51:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-17 22:51:14,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,702 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-17 22:51:14,702 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-17 22:51:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:14,706 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-17 22:51:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-17 22:51:14,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:14,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:14,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:14,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:51:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-17 22:51:14,711 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-17 22:51:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:14,712 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-17 22:51:14,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:51:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:51:14,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:14,713 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:14,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:51:14,714 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash -94267114, now seen corresponding path program 1 times [2020-07-17 22:51:14,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:14,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831231384] [2020-07-17 22:51:14,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:14,917 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {329#true} {329#true} #49#return; {329#true} is VALID [2020-07-17 22:51:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:14,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:14,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:14,942 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:14,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:14,969 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:14,971 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #55#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:14,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:14,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:14,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,003 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {329#true} {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,004 INFO L263 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2020-07-17 22:51:15,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {329#true} {329#true} #49#return; {329#true} is VALID [2020-07-17 22:51:15,005 INFO L263 TraceCheckUtils]: 3: Hoare triple {329#true} call #t~ret2 := main(); {329#true} is VALID [2020-07-17 22:51:15,005 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {329#true} is VALID [2020-07-17 22:51:15,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {333#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,009 INFO L280 TraceCheckUtils]: 6: Hoare triple {333#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,010 INFO L280 TraceCheckUtils]: 7: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,010 INFO L263 TraceCheckUtils]: 8: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-17 22:51:15,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:15,012 INFO L280 TraceCheckUtils]: 10: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:15,012 INFO L280 TraceCheckUtils]: 11: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,017 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,018 INFO L263 TraceCheckUtils]: 13: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {329#true} is VALID [2020-07-17 22:51:15,018 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:15,018 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:15,019 INFO L280 TraceCheckUtils]: 16: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,021 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #55#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,023 INFO L280 TraceCheckUtils]: 18: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,024 INFO L263 TraceCheckUtils]: 20: Hoare triple {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-17 22:51:15,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:15,025 INFO L280 TraceCheckUtils]: 22: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:15,025 INFO L280 TraceCheckUtils]: 23: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,026 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {329#true} {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,028 INFO L263 TraceCheckUtils]: 25: Hoare triple {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {348#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:15,031 INFO L280 TraceCheckUtils]: 26: Hoare triple {348#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {349#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:15,032 INFO L280 TraceCheckUtils]: 27: Hoare triple {349#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {330#false} is VALID [2020-07-17 22:51:15,033 INFO L280 TraceCheckUtils]: 28: Hoare triple {330#false} assume !false; {330#false} is VALID [2020-07-17 22:51:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:51:15,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831231384] [2020-07-17 22:51:15,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112841409] [2020-07-17 22:51:15,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:51:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:15,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:15,363 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:15,391 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:15,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2020-07-17 22:51:15,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,450 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {329#true} {329#true} #49#return; {329#true} is VALID [2020-07-17 22:51:15,451 INFO L263 TraceCheckUtils]: 3: Hoare triple {329#true} call #t~ret2 := main(); {329#true} is VALID [2020-07-17 22:51:15,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {329#true} is VALID [2020-07-17 22:51:15,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {333#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:15,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {333#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-17 22:51:15,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-17 22:51:15,459 INFO L263 TraceCheckUtils]: 8: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-17 22:51:15,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:15,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:15,460 INFO L280 TraceCheckUtils]: 11: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,462 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {329#true} {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #53#return; {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-17 22:51:15,462 INFO L263 TraceCheckUtils]: 13: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {329#true} is VALID [2020-07-17 22:51:15,463 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:15,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:15,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,465 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {329#true} {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #55#return; {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-17 22:51:15,467 INFO L280 TraceCheckUtils]: 18: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} is VALID [2020-07-17 22:51:15,468 INFO L280 TraceCheckUtils]: 19: Hoare triple {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} is VALID [2020-07-17 22:51:15,469 INFO L263 TraceCheckUtils]: 20: Hoare triple {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-17 22:51:15,469 INFO L280 TraceCheckUtils]: 21: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-17 22:51:15,470 INFO L280 TraceCheckUtils]: 22: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-17 22:51:15,470 INFO L280 TraceCheckUtils]: 23: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-17 22:51:15,472 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {329#true} {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} #53#return; {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} is VALID [2020-07-17 22:51:15,474 INFO L263 TraceCheckUtils]: 25: Hoare triple {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {430#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:15,475 INFO L280 TraceCheckUtils]: 26: Hoare triple {430#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {434#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:15,476 INFO L280 TraceCheckUtils]: 27: Hoare triple {434#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {330#false} is VALID [2020-07-17 22:51:15,476 INFO L280 TraceCheckUtils]: 28: Hoare triple {330#false} assume !false; {330#false} is VALID [2020-07-17 22:51:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:51:15,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:15,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-17 22:51:15,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082090019] [2020-07-17 22:51:15,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-17 22:51:15,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:15,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:51:15,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:15,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:51:15,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:15,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:51:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:51:15,540 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 11 states. [2020-07-17 22:51:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:15,947 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-17 22:51:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:15,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-17 22:51:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:51:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-17 22:51:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:51:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-17 22:51:15,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2020-07-17 22:51:16,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:16,007 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:51:16,007 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:51:16,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:51:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-17 22:51:16,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:16,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-17 22:51:16,037 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-17 22:51:16,037 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-17 22:51:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,042 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-17 22:51:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-17 22:51:16,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,044 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-17 22:51:16,044 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-17 22:51:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,048 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-17 22:51:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-17 22:51:16,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:16,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:51:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-17 22:51:16,054 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2020-07-17 22:51:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:16,055 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-17 22:51:16,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:51:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-17 22:51:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-17 22:51:16,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:16,057 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:16,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:51:16,272 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2069363338, now seen corresponding path program 2 times [2020-07-17 22:51:16,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:16,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794028626] [2020-07-17 22:51:16,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,416 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {625#true} {625#true} #49#return; {625#true} is VALID [2020-07-17 22:51:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,424 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,436 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,444 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,453 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,462 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,463 INFO L263 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2020-07-17 22:51:16,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,463 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #49#return; {625#true} is VALID [2020-07-17 22:51:16,463 INFO L263 TraceCheckUtils]: 3: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2020-07-17 22:51:16,464 INFO L280 TraceCheckUtils]: 4: Hoare triple {625#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {625#true} is VALID [2020-07-17 22:51:16,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {625#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {625#true} is VALID [2020-07-17 22:51:16,465 INFO L280 TraceCheckUtils]: 6: Hoare triple {625#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,466 INFO L280 TraceCheckUtils]: 7: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,466 INFO L263 TraceCheckUtils]: 8: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,466 INFO L280 TraceCheckUtils]: 9: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,467 INFO L280 TraceCheckUtils]: 11: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,468 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,468 INFO L263 TraceCheckUtils]: 13: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,469 INFO L280 TraceCheckUtils]: 14: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,469 INFO L280 TraceCheckUtils]: 16: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,470 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,471 INFO L280 TraceCheckUtils]: 18: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,471 INFO L280 TraceCheckUtils]: 19: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,472 INFO L263 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,472 INFO L280 TraceCheckUtils]: 21: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,472 INFO L280 TraceCheckUtils]: 22: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,473 INFO L280 TraceCheckUtils]: 23: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,474 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,474 INFO L263 TraceCheckUtils]: 25: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,474 INFO L280 TraceCheckUtils]: 26: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,474 INFO L280 TraceCheckUtils]: 27: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,475 INFO L280 TraceCheckUtils]: 28: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,476 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,476 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,477 INFO L280 TraceCheckUtils]: 31: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,478 INFO L263 TraceCheckUtils]: 32: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,478 INFO L280 TraceCheckUtils]: 33: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,478 INFO L280 TraceCheckUtils]: 34: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,478 INFO L280 TraceCheckUtils]: 35: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,479 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {625#true} {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,481 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {651#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:16,481 INFO L280 TraceCheckUtils]: 38: Hoare triple {651#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {652#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:16,482 INFO L280 TraceCheckUtils]: 39: Hoare triple {652#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {626#false} is VALID [2020-07-17 22:51:16,482 INFO L280 TraceCheckUtils]: 40: Hoare triple {626#false} assume !false; {626#false} is VALID [2020-07-17 22:51:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-07-17 22:51:16,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794028626] [2020-07-17 22:51:16,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585436915] [2020-07-17 22:51:16,486 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:16,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:51:16,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:16,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:51:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:16,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:16,652 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:16,703 INFO L263 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2020-07-17 22:51:16,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,704 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #49#return; {625#true} is VALID [2020-07-17 22:51:16,704 INFO L263 TraceCheckUtils]: 3: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2020-07-17 22:51:16,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {625#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {625#true} is VALID [2020-07-17 22:51:16,705 INFO L280 TraceCheckUtils]: 5: Hoare triple {625#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {625#true} is VALID [2020-07-17 22:51:16,706 INFO L280 TraceCheckUtils]: 6: Hoare triple {625#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,707 INFO L280 TraceCheckUtils]: 7: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,707 INFO L263 TraceCheckUtils]: 8: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,708 INFO L280 TraceCheckUtils]: 11: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,709 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,709 INFO L263 TraceCheckUtils]: 13: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,709 INFO L280 TraceCheckUtils]: 14: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,710 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,710 INFO L280 TraceCheckUtils]: 16: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,711 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,712 INFO L280 TraceCheckUtils]: 18: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,713 INFO L280 TraceCheckUtils]: 19: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,713 INFO L263 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,713 INFO L280 TraceCheckUtils]: 21: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,714 INFO L280 TraceCheckUtils]: 22: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,714 INFO L280 TraceCheckUtils]: 23: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,715 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,715 INFO L263 TraceCheckUtils]: 25: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,716 INFO L280 TraceCheckUtils]: 26: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,716 INFO L280 TraceCheckUtils]: 27: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,716 INFO L280 TraceCheckUtils]: 28: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,717 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,718 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,719 INFO L280 TraceCheckUtils]: 31: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,720 INFO L263 TraceCheckUtils]: 32: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-17 22:51:16,720 INFO L280 TraceCheckUtils]: 33: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-17 22:51:16,720 INFO L280 TraceCheckUtils]: 34: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-17 22:51:16,720 INFO L280 TraceCheckUtils]: 35: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-17 22:51:16,722 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {625#true} {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-17 22:51:16,724 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:16,725 INFO L280 TraceCheckUtils]: 38: Hoare triple {767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:16,726 INFO L280 TraceCheckUtils]: 39: Hoare triple {771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {626#false} is VALID [2020-07-17 22:51:16,726 INFO L280 TraceCheckUtils]: 40: Hoare triple {626#false} assume !false; {626#false} is VALID [2020-07-17 22:51:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-07-17 22:51:16,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:16,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-17 22:51:16,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443575257] [2020-07-17 22:51:16,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-07-17 22:51:16,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:16,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:51:16,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:16,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:51:16,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:51:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:51:16,764 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2020-07-17 22:51:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,960 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-17 22:51:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:16,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-07-17 22:51:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:51:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2020-07-17 22:51:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:51:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2020-07-17 22:51:16,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2020-07-17 22:51:16,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:16,990 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:51:16,990 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:16,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:51:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:16,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:16,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,993 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,994 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,994 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:16,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,995 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,995 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:16,996 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:16,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:16,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:16,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:16,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:16,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-17 22:51:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:16,997 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:16,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:51:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:16,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:17,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:17,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:17,309 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:17,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:17,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:17,310 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:17,310 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:17,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:17,310 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:17,310 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:17,310 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:17,311 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:17,311 INFO L271 CegarLoopResult]: At program point L33(lines 14 34) the Hoare annotation is: true [2020-07-17 22:51:17,311 INFO L268 CegarLoopResult]: For program point L31(lines 27 32) no Hoare annotation was computed. [2020-07-17 22:51:17,311 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)) [2020-07-17 22:51:17,311 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 34) the Hoare annotation is: true [2020-07-17 22:51:17,311 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)) [2020-07-17 22:51:17,312 INFO L264 CegarLoopResult]: At program point L27-2(lines 27 32) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 1 main_~MAXPATHLEN~0)) [2020-07-17 22:51:17,312 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 34) no Hoare annotation was computed. [2020-07-17 22:51:17,312 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-17 22:51:17,312 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-17 22:51:17,312 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 34) no Hoare annotation was computed. [2020-07-17 22:51:17,312 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:17,312 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:17,312 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:17,313 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:17,313 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:17,313 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:17,319 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:17,320 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:17,320 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:17,320 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:17,320 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:17,320 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:17,320 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:17,320 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:17,321 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:17,322 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:17,322 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:17,323 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:17,323 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:17,323 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:17,324 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:17,324 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:51:17,324 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:51:17,324 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:17,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:17 BoogieIcfgContainer [2020-07-17 22:51:17,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:17,339 INFO L168 Benchmark]: Toolchain (without parser) took 5030.97 ms. Allocated memory was 135.3 MB in the beginning and 255.3 MB in the end (delta: 120.1 MB). Free memory was 99.8 MB in the beginning and 204.7 MB in the end (delta: -104.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:17,343 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:17,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.90 ms. Allocated memory is still 135.3 MB. Free memory was 99.4 MB in the beginning and 89.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:17,346 INFO L168 Benchmark]: Boogie Preprocessor took 124.08 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 178.8 MB in the end (delta: -89.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:17,347 INFO L168 Benchmark]: RCFGBuilder took 360.39 ms. Allocated memory is still 198.7 MB. Free memory was 177.4 MB in the beginning and 160.0 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:17,350 INFO L168 Benchmark]: TraceAbstraction took 4237.16 ms. Allocated memory was 198.7 MB in the beginning and 255.3 MB in the end (delta: 56.6 MB). Free memory was 160.0 MB in the beginning and 204.7 MB in the end (delta: -44.7 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:17,359 INFO L336 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.27 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.90 ms. Allocated memory is still 135.3 MB. Free memory was 99.4 MB in the beginning and 89.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.08 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 178.8 MB in the end (delta: -89.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.39 ms. Allocated memory is still 198.7 MB. Free memory was 177.4 MB in the beginning and 160.0 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4237.16 ms. Allocated memory was 198.7 MB in the beginning and 255.3 MB in the end (delta: 56.6 MB). Free memory was 160.0 MB in the beginning and 204.7 MB in the end (delta: -44.7 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (glob2_pathlim_off <= MAXPATHLEN && 0 <= glob2_p_off) && 1 <= MAXPATHLEN - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 6, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 SDtfs, 39 SDslu, 232 SDs, 0 SdLazy, 135 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 27 NumberOfFragments, 42 HoareAnnotationTreeSize, 16 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 9919 SizeOfPredicates, 9 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 150/164 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...