java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:51:09,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:51:09,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:51:09,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:51:09,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:51:09,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:51:09,191 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:51:09,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:51:09,194 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:51:09,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:51:09,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:51:09,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:51:09,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:51:09,197 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:51:09,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:51:09,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:51:09,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:51:09,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:51:09,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:51:09,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:51:09,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:51:09,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:51:09,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:51:09,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:51:09,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:51:09,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:51:09,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:51:09,210 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:51:09,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:51:09,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:51:09,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:51:09,211 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:51:09,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:51:09,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:51:09,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:51:09,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:51:09,222 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:51:09,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:51:09,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:51:09,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:51:09,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:51:09,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:51:09,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:51:09,224 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:51:09,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:51:09,224 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:51:09,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:51:09,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:51:09,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:51:09,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:51:09,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:51:09,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:51:09,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:51:09,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:51:09,225 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:51:09,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:51:09,226 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:51:09,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:51:09,261 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:51:09,264 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:51:09,265 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:51:09,265 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:51:09,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:51:09,376 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:51:09,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:51:09,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:51:09,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:51:09,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:51:09,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09, skipping insertion in model container [2018-02-03 22:51:09,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,403 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:51:09,437 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:51:09,525 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:51:09,538 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:51:09,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09 WrapperNode [2018-02-03 22:51:09,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:51:09,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:51:09,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:51:09,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:51:09,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... [2018-02-03 22:51:09,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:51:09,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:51:09,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:51:09,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:51:09,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-03 22:51:09,606 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:51:09,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:51:09,607 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-02-03 22:51:09,607 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:51:09,607 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:51:09,607 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:51:09,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:51:09,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:51:09,607 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:51:09,608 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:51:09,608 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-02-03 22:51:09,608 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:51:09,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:51:09,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:51:09,774 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:51:09,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:51:09 BoogieIcfgContainer [2018-02-03 22:51:09,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:51:09,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:51:09,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:51:09,778 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:51:09,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:51:09" (1/3) ... [2018-02-03 22:51:09,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:51:09, skipping insertion in model container [2018-02-03 22:51:09,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:09" (2/3) ... [2018-02-03 22:51:09,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:51:09, skipping insertion in model container [2018-02-03 22:51:09,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:51:09" (3/3) ... [2018-02-03 22:51:09,781 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:51:09,786 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:51:09,790 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-03 22:51:09,823 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:51:09,824 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:51:09,824 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:51:09,824 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:51:09,824 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:51:09,824 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:51:09,824 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:51:09,824 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:51:09,825 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:51:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-03 22:51:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-03 22:51:09,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:09,843 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:09,843 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-02-03 22:51:09,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:09,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:09,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:09,879 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:09,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:09,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:09,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:09,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:51:09,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:51:09,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:51:09,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:51:09,979 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-03 22:51:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,053 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-03 22:51:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:51:10,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-03 22:51:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,062 INFO L225 Difference]: With dead ends: 44 [2018-02-03 22:51:10,062 INFO L226 Difference]: Without dead ends: 40 [2018-02-03 22:51:10,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-03 22:51:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-03 22:51:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-03 22:51:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-03 22:51:10,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-02-03 22:51:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,127 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-03 22:51:10,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:51:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-03 22:51:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-03 22:51:10,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,127 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,127 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-02-03 22:51:10,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,128 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:10,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 22:51:10,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:51:10,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:51:10,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:51:10,149 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-02-03 22:51:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,192 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-03 22:51:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:51:10,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-03 22:51:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,194 INFO L225 Difference]: With dead ends: 39 [2018-02-03 22:51:10,194 INFO L226 Difference]: Without dead ends: 38 [2018-02-03 22:51:10,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:51:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-03 22:51:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-03 22:51:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-03 22:51:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-03 22:51:10,199 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-03 22:51:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,200 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-03 22:51:10,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:51:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-03 22:51:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:51:10,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,201 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,201 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-02-03 22:51:10,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,202 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:10,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:51:10,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:51:10,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:51:10,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:51:10,250 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-03 22:51:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,299 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-03 22:51:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:51:10,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:51:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,300 INFO L225 Difference]: With dead ends: 36 [2018-02-03 22:51:10,300 INFO L226 Difference]: Without dead ends: 36 [2018-02-03 22:51:10,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-03 22:51:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-03 22:51:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:51:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:51:10,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-03 22:51:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,304 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:51:10,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:51:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:51:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:51:10,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,305 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,305 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-02-03 22:51:10,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:10,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:51:10,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:51:10,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:51:10,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:10,373 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-03 22:51:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,416 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-03 22:51:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:10,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:51:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,417 INFO L225 Difference]: With dead ends: 35 [2018-02-03 22:51:10,417 INFO L226 Difference]: Without dead ends: 35 [2018-02-03 22:51:10,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-03 22:51:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-03 22:51:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-03 22:51:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-03 22:51:10,419 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-03 22:51:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,420 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-03 22:51:10,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:51:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-03 22:51:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:51:10,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,420 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-02-03 22:51:10,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:10,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:51:10,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:51:10,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:51:10,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:10,452 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-03 22:51:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,481 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-03 22:51:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:51:10,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-03 22:51:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,481 INFO L225 Difference]: With dead ends: 34 [2018-02-03 22:51:10,481 INFO L226 Difference]: Without dead ends: 34 [2018-02-03 22:51:10,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-03 22:51:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-03 22:51:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-03 22:51:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-03 22:51:10,483 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-03 22:51:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,484 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-03 22:51:10,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:51:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-03 22:51:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:51:10,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,484 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,484 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-02-03 22:51:10,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:10,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:51:10,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:51:10,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:51:10,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:10,565 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-03 22:51:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,629 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-03 22:51:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:51:10,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-03 22:51:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,633 INFO L225 Difference]: With dead ends: 44 [2018-02-03 22:51:10,633 INFO L226 Difference]: Without dead ends: 44 [2018-02-03 22:51:10,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:51:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-03 22:51:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-02-03 22:51:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:51:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:51:10,636 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-02-03 22:51:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,637 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:51:10,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:51:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:51:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:51:10,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,637 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,638 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-02-03 22:51:10,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,639 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:10,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:51:10,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:51:10,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:51:10,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:10,719 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-02-03 22:51:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,788 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-03 22:51:10,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:10,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-03 22:51:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,789 INFO L225 Difference]: With dead ends: 35 [2018-02-03 22:51:10,789 INFO L226 Difference]: Without dead ends: 35 [2018-02-03 22:51:10,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:51:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-03 22:51:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-03 22:51:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-03 22:51:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-03 22:51:10,792 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-02-03 22:51:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,792 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-03 22:51:10,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:51:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-03 22:51:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:51:10,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,793 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,793 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-02-03 22:51:10,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:10,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:51:10,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:51:10,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:51:10,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:10,865 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-02-03 22:51:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,956 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-03 22:51:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:51:10,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-03 22:51:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,957 INFO L225 Difference]: With dead ends: 41 [2018-02-03 22:51:10,957 INFO L226 Difference]: Without dead ends: 41 [2018-02-03 22:51:10,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-03 22:51:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-02-03 22:51:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:51:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:51:10,960 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-02-03 22:51:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,960 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:51:10,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:51:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:51:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:51:10,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,961 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,961 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-02-03 22:51:10,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,961 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:10,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:11,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:11,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:51:11,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:51:11,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:51:11,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:51:11,070 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-02-03 22:51:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:11,155 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-02-03 22:51:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:51:11,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-03 22:51:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:11,155 INFO L225 Difference]: With dead ends: 58 [2018-02-03 22:51:11,155 INFO L226 Difference]: Without dead ends: 58 [2018-02-03 22:51:11,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-02-03 22:51:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-03 22:51:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-02-03 22:51:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:51:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-02-03 22:51:11,158 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-02-03 22:51:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:11,159 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-02-03 22:51:11,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:51:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-02-03 22:51:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:51:11,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:11,159 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:11,159 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-02-03 22:51:11,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:11,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:11,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:11,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:11,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:11,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:11,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:11,300 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:11,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:11,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:11,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:51:11,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:51:11,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:11,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:11,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:11,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:51:11,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-03 22:51:11,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:51:11,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:11,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:11,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:11,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-03 22:51:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:11,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:11,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-02-03 22:51:11,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 22:51:11,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 22:51:11,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:51:11,565 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 17 states. [2018-02-03 22:51:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:11,859 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-03 22:51:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:51:11,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-02-03 22:51:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:11,861 INFO L225 Difference]: With dead ends: 65 [2018-02-03 22:51:11,861 INFO L226 Difference]: Without dead ends: 65 [2018-02-03 22:51:11,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:51:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-03 22:51:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-02-03 22:51:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-03 22:51:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-03 22:51:11,865 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-02-03 22:51:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:11,865 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-03 22:51:11,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 22:51:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-03 22:51:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:51:11,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:11,866 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:11,866 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-02-03 22:51:11,867 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:11,867 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:11,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:11,868 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:11,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:11,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:12,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:12,027 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-02-03 22:51:12,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:12,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:12,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:12,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:12,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-03 22:51:12,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:12,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:12,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:51:12,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:51:12,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-03 22:51:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:12,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:12,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-03 22:51:12,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:51:12,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:51:12,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:51:12,279 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 22 states. [2018-02-03 22:51:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:12,670 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-02-03 22:51:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:51:12,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-02-03 22:51:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:12,671 INFO L225 Difference]: With dead ends: 63 [2018-02-03 22:51:12,671 INFO L226 Difference]: Without dead ends: 63 [2018-02-03 22:51:12,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:51:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-03 22:51:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-02-03 22:51:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:51:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-03 22:51:12,674 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2018-02-03 22:51:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:12,679 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-03 22:51:12,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:51:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-03 22:51:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:51:12,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:12,679 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:12,679 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-02-03 22:51:12,680 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:12,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:12,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:12,680 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:12,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:12,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:12,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:12,952 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:12,959 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:12,979 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:12,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:12,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:12,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:12,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:51:12,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:12,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:12,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:51:12,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:12,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:51:13,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:51:13,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:51:13,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:13,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:13,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:13,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-03 22:51:13,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-03 22:51:13,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 22:51:13,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:13,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:13,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:13,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-02-03 22:51:13,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-03 22:51:13,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:51:13,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:13,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:13,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:13,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-02-03 22:51:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:13,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:13,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-02-03 22:51:13,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-03 22:51:13,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-03 22:51:13,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:51:13,216 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 21 states. [2018-02-03 22:51:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:13,710 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-02-03 22:51:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:51:13,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-02-03 22:51:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:13,711 INFO L225 Difference]: With dead ends: 62 [2018-02-03 22:51:13,711 INFO L226 Difference]: Without dead ends: 62 [2018-02-03 22:51:13,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 22:51:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-03 22:51:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-02-03 22:51:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-03 22:51:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-02-03 22:51:13,715 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2018-02-03 22:51:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:13,715 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-02-03 22:51:13,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-03 22:51:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-02-03 22:51:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:51:13,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:13,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:13,716 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:51:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-02-03 22:51:13,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:13,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:13,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:13,717 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:13,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:13,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:13,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:13,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:13,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:13,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:13,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:13,777 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-02-03 22:51:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:13,845 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-03 22:51:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:51:13,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-03 22:51:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:13,846 INFO L225 Difference]: With dead ends: 45 [2018-02-03 22:51:13,846 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:51:13,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:51:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:51:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:51:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:51:13,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-02-03 22:51:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:13,848 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:51:13,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:51:13,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:51:13,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:51:13 BoogieIcfgContainer [2018-02-03 22:51:13,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:51:13,853 INFO L168 Benchmark]: Toolchain (without parser) took 4476.33 ms. Allocated memory was 412.6 MB in the beginning and 713.0 MB in the end (delta: 300.4 MB). Free memory was 370.6 MB in the beginning and 595.6 MB in the end (delta: -225.0 MB). Peak memory consumption was 75.5 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:13,854 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 412.6 MB. Free memory is still 375.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:51:13,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.39 ms. Allocated memory is still 412.6 MB. Free memory was 369.3 MB in the beginning and 358.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:13,854 INFO L168 Benchmark]: Boogie Preprocessor took 22.33 ms. Allocated memory is still 412.6 MB. Free memory was 358.7 MB in the beginning and 357.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:13,855 INFO L168 Benchmark]: RCFGBuilder took 208.08 ms. Allocated memory is still 412.6 MB. Free memory was 357.4 MB in the beginning and 340.2 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:13,855 INFO L168 Benchmark]: TraceAbstraction took 4077.18 ms. Allocated memory was 412.6 MB in the beginning and 713.0 MB in the end (delta: 300.4 MB). Free memory was 338.8 MB in the beginning and 595.6 MB in the end (delta: -256.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:13,856 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 412.6 MB. Free memory is still 375.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.39 ms. Allocated memory is still 412.6 MB. Free memory was 369.3 MB in the beginning and 358.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.33 ms. Allocated memory is still 412.6 MB. Free memory was 358.7 MB in the beginning and 357.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 208.08 ms. Allocated memory is still 412.6 MB. Free memory was 357.4 MB in the beginning and 340.2 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4077.18 ms. Allocated memory was 412.6 MB in the beginning and 713.0 MB in the end (delta: 300.4 MB). Free memory was 338.8 MB in the beginning and 595.6 MB in the end (delta: -256.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 4.0s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 369 SDtfs, 494 SDslu, 1475 SDs, 0 SdLazy, 1234 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 308 ConstructedInterpolants, 13 QuantifiedInterpolants, 52692 SizeOfPredicates, 27 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 2/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-51-13-862.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-51-13-862.csv Received shutdown request...